Wu Soon-Yi

Soon-Yi Wu

Information about the author Soon-Yi Wu will soon be added to the site.
Found 9 papers in total
Primal and dual alternating direction algorithms for l1‐l1‐norm minimization problems in compressive sensing
Primal and dual alternating direction algorithms for l1‐l1‐norm minimization problems in compressive sensing
2013
In this paper, we propose, analyze and test primal and dual versions of the...
Relaxed cutting plane method with convexification for solving nonlinear semi‐infinite programming problems
Relaxed cutting plane method with convexification for solving nonlinear semi‐infinite programming problems
2012
In this paper, we present an algorithm to solve nonlinear semi‐infinite...
A smoothing SQP method for nonlinear programs with stability constraints arising from power systems
A smoothing SQP method for nonlinear programs with stability constraints arising from power systems
2012
This paper investigates a new class of optimization problems arising from power...
A new approach to the weighted peak‐constrained least‐square error FIR digital filter optimal design problem
A new approach to the weighted peak‐constrained least‐square error FIR digital filter optimal design problem
2011
This paper deals with the design of linear‐phase finite impulse response (FIR)...
A Smoothing Newton Method for Semi‐Infinite Programming
A Smoothing Newton Method for Semi‐Infinite Programming
2004
This paper is concerned with numerical methods for solving a semi‐infinite...
New approach for the nonlinear programming with transient stability constraints arising from power systems
New approach for the nonlinear programming with transient stability constraints arising from power systems
2010
This paper presents a new approach for solving a class of complicated nonlinear...
Solving general capacity problem by relaxed cutting plane approach
Solving general capacity problem by relaxed cutting plane approach
2001
This paper studies a class of infinite dimensional linear programming problems known...
Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
1999
One of the major computational bottlenecks of using the conventional cutting plane...
Implementation of an inexact approach to solving linear semi-infinite programming problems
Implementation of an inexact approach to solving linear semi-infinite programming problems
1995
In this paper, the authors implement an extended version of the inexact approach...
Papers per page: