A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
From MaRDI portal
Publication:4441939
DOI10.1137/S1052623401398120zbMath1060.90077OpenAlexW2006905759MaRDI QIDQ4441939
Zhi-Quan Luo, Masao Fukushima, Paul Tseng
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623401398120
quadratically constrained quadratic programmingglobal convergenceconvex programmingquadratic convergenceMaratos effect
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Related Items
New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate, Quadratically constraint quadratical algorithm model for nonlinear minimax problems, A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem, New cooperative projection neural network for nonlinearly constrained variational inequality, A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming, An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming, A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results, A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems, A working set SQCQP algorithm with simple nonmonotone penalty parameters, A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application, A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function, A Globally Convergent SQCQP Method for Multiobjective Optimization Problems, A quadratically approximate framework for constrained optimization, global and local convergence, A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization, Single pass computation of first seismic wave travel time in three dimensional heterogeneous media with general anisotropy, Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems, A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences, On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems, A sequential quadratically constrained quadratic programming method of feasible directions, Newton-type methods: a broader view, Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization, Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs, A global QP-free algorithm for mathematical programs with complementarity constraints, A sequential quadratically constrained quadratic programming method for unconstrained minimax problems, A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization, Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
