Pages that link to "Item:Q1016107"

The following pages link to Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences (Q1016107):

Displaying 22 items.

• A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
• Feedback stabilization methods for the solution of nonlinear programming problems (Q398644) (← links)
• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
• Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems (Q779870) (← links)
• A new norm-relaxed SQP algorithm with global convergence (Q972949) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)
• An ADMM-based SQP method for separably smooth nonconvex optimization (Q2069362) (← links)
• A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
• A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization (Q2088141) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← 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)
• Some new facts about sequential quadratic programming methods employing second derivatives (Q2829576) (← links)
• An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
• A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization (Q5085236) (← links)
• Global Dynamical Solvers for Nonlinear Programming Problems (Q5346496) (← links)
• A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization (Q6102892) (← links)