The following pages link to Soon-Yi Wu (Q186229):
Displayed 50 items.
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing (Q1946621) (← links)
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations (Q1955536) (← links)
- A new iterative method for finding common solutions of a system of equilibrium problems, fixed-point problems, and variational inequalities (Q1957579) (← links)
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110) (← links)
- Relaxed cutting plane method for solving linear semi-infinite programming problems (Q1969533) (← links)
- Multiobjective DC programs with infinite convex constraints (Q2249821) (← links)
- A numerical approach to infinite-dimensional linear programming in \(L_1\) spaces (Q2269742) (← links)
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning (Q2358899) (← links)
- Global convergence of a robust smoothing SQP method for semi-infinite programming (Q2370033) (← links)
- Generalized KKM theorem with applications to generalized minimax inequalities and generalized equilibrium problems (Q2372394) (← links)
- First-order optimality conditions for convex semi-infinite min-max programming with noncompact sets (Q2379825) (← links)
- A new approximation scheme combining the viscosity method with extragradient method for mixed equilibrium problems (Q2381012) (← links)
- An algorithm based on the generalized D-gap function for equilibrium problems (Q2389572) (← links)
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case (Q2399192) (← links)
- Gâteaux differentiability of the dual gap function of a variational inequality (Q2427179) (← links)
- Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming (Q2454635) (← links)
- Algorithms for infinite quadratic programming in \(L_p\) spaces (Q2479348) (← links)
- Gap functions and existence of solutions to generalized vector quasi-equilibrium problems (Q2494293) (← links)
- A relaxed cutting plane method for semi-infinite semi-definite programming (Q2503018) (← links)
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
- Solving variational inequalities defined on a domain with infinitely many linear constraints (Q2642631) (← links)
- (Q2776654) (← links)
- (Q2776656) (← links)
- An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (Q2829601) (← links)
- On the largest eigenvalue of a symmetric nonnegative tensor (Q2936740) (← links)
- The capacity problem (Q3032102) (← links)
- A New Exchange Method for Convex Semi-Infinite Programming (Q3083316) (← links)
- Generalized vector variational-like inequalities and nonsmooth vector optimization problems (Q3165913) (← links)
- The continuous complementarity problem (Q3363080) (← links)
- An iterative method for solving KKT system of the semi-infinite programming (Q3369516) (← links)
- (Q3384760) (← links)
- (Q3489786) (← links)
- (Q3550726) (← links)
- An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints (Q3586147) (← links)
- (Q3679000) (← links)
- An inexact approach to solving linear semi-infinite programming problems (Q3835641) (← links)
- Extremal Points and an Algorithm for a Class of Continuous Transportation Problems (Q4008472) (← links)
- On Linear Semi-Infinite Programming Problems: An Algorithm (Q4029144) (← links)
- (Q4224866) (← links)
- An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming (Q4389200) (← links)
- Weak Sharp Solutions of Variational Inequalities in Hilbert Spaces (Q4651980) (← links)
- On solving convex quadratic semi-infinite programming probelms (Q4764835) (← links)
- Linear programming in measure spaces (Q4764890) (← links)
- A solution method for combined semi-infinite and semi-definite programming (Q4831772) (← links)
- (Q4840107) (← links)
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations (Q4899021) (← links)
- (Q5148351) (← links)
- (Q5501739) (← links)
- (Q5708804) (← links)
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072) (← links)