A working set SQCQP algorithm with simple nonmonotone penalty parameters
From MaRDI portal
Publication:654747
Recommendations
- An SQCQP algorithm with new active identification set for inequality constrained optimization
- A nonmonotone SQP method for nonlinear programming without a penalty function
- A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
- scientific article; zbMATH DE number 151663
- On the Sequential Quadratically Constrained Quadratic Programming Methods
Cites work
- scientific article; zbMATH DE number 1301595 (Why is no real title available?)
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A quadratically approximate framework for constrained optimization, global and local convergence
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Applications of second-order cone programming
- CUTE
- Computing a Trust Region Step
- Exact penalty function algorithm with simple updating of the penalty parameter
- New Results on a Continuously Differentiable Exact Penalty Function
- 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 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
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Test examples for nonlinear programming codes
- The method of moving asymptotes—a new method for structural optimization
Cited in
(5)- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- An SQCQP algorithm with new active identification set for inequality constrained optimization
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
This page was built for publication: A working set SQCQP algorithm with simple nonmonotone penalty parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654747)
