An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
From MaRDI portal
Publication:1949595
DOI10.1007/s10957-012-0145-zzbMath1290.90060MaRDI QIDQ1949595
Publication date: 8 May 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0145-z
Related Items
Qualification Conditions in Semialgebraic Programming, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization, Stochastic proximal linear method for structured non-convex problems, The value function approach to convergence analysis in composite optimization, The multiproximal linearization method for convex composite problems, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Successive linearization methods for nonlinear semidefinite programs
- Tame functions are semismooth
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
- An SQP-type algorithm for nonlinear second-order cone programs
- Lectures on Modern Convex Optimization
- Sequential Quadratic Programming Methods
- A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems
- A successive quadratic programming algorithm with global and superlinear convergence properties
- Variational Analysis
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A Global Algorithm for Nonlinear Semidefinite Programming
- On the Sequential Quadratically Constrained Quadratic Programming Methods
