A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization

DOI10.1080/02331934.2020.1818744zbMath1489.90187OpenAlexW3087438694MaRDI QIDQ5085233

Meixing Liu, Chun-Ming Tang, Jin-Bao Jian

Publication date: 27 June 2022

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2020.1818744

zbMATH Keywords

global convergencesuperlinear convergenceinequality constrained optimizationactive set identificationSQCQP

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (2)

A method of sequential log-convex programming for engineering design ⋮ Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure

Uses Software

• Mosek
• CUTE

Cites Work

• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
• On the accurate identification of active set for constrained minimax problems
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
• A working set SQCQP algorithm with simple nonmonotone penalty parameters
• New active set identification for general constrained optimization and minimax problems
• A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
• A quadratically approximate framework for constrained optimization, global and local convergence
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
• More test examples for nonlinear programming codes
• Applications of second-order cone programming
• Test examples for nonlinear programming codes
• Handbook of test problems in local and global optimization
• On implementing a primal-dual interior-point method for conic quadratic optimization
• Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
• New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
• A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
• 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
• On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• On the Identification of Active Constraints
• On the Accurate Identification of Active Constraints
• CUTE
• A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
• A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
• On the Sequential Quadratically Constrained Quadratic Programming Methods
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization