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

Recommendations

An SQCQP algorithm with new active identification set for inequality constrained optimization
A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
A strongly sub-feasible norm-relaxed SQCQP algorithm for the inequality constrained minimax problems
An active-set algorithm for norm constrained quadratic problems
A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
scientific article; zbMATH DE number 1131695
An improved active set feasible SQP algorithm for the solution of inequality constrained optimization problems
A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
Inequality constrained stochastic nonlinear optimization via active-set sequential quadratic programming

Cites work

A quadratically approximate framework for constrained optimization, global and local convergence
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
A sequential quadratically constrained quadratic programming method of feasible directions
A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
A working set SQCQP algorithm with simple nonmonotone penalty parameters
An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Applications of second-order cone programming
Benchmarking optimization software with performance profiles.
CUTE
Global and superlinear convergence of inexact sequential quadratically constrained quadratic programming method for convex programming
Handbook of test problems in local and global optimization
scientific article; zbMATH DE number 3583207 (Why is no real title available?)
scientific article; zbMATH DE number 2155014 (Why is no real title available?)
scientific article; zbMATH DE number 6263004 (Why is no real title available?)
More test examples for nonlinear programming codes
New active set identification for general constrained optimization and minimax problems
New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
On implementing a primal-dual interior-point method for conic quadratic optimization
On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
On the Accurate Identification of Active Constraints
On the accurate identification of active set for constrained minimax problems
On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
On the Identification of Active Constraints
On the Sequential Quadratically Constrained Quadratic Programming Methods
Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
Test examples for nonlinear programming codes
The superlinear convergence of a modified BFGS-type method for unconstrained optimization

Cited in

(4)

A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure
A norm-relaxed algorithm with an identification function for general constrained optimization
A method of sequential log-convex programming for engineering design

Describes a project that uses

Uses Software

Mosek
CUTE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085233)