Pages that link to "Item:Q3083329"

The following pages link to A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems (Q3083329):

Displayed 12 items.

• A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) ‎ (← links)
• An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) ‎ (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) ‎ (← links)
• Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) ‎ (← links)
• A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (Q2434998) ‎ (← links)
• Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) ‎ (← links)
• Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs (Q2806813) ‎ (← links)
• Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) ‎ (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) ‎ (← links)
• Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) ‎ (← links)
• High-Order Optimization Methods for Fully Composite Problems (Q5869820) ‎ (← links)
• A new low-cost feasible projection algorithm for pseudomonotone variational inequalities (Q6047574) ‎ (← links)