A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
From MaRDI portal
Recommendations
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- scientific article; zbMATH DE number 151663
- A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A SQP algorithm based on a smoothing lower order penalty function for inequality constrained optimization
Cited in
(19)- Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
- A sequential quadratically constrained quadratic programming method of feasible directions
- Parameter optimization using the L_ exact penalty function and strictly convex quadratic programming problems
- A SQP method for equality constrained optimization and its convergence
- A SQP procedure for global optimization
- A robust SQP method based on a smoothing lower order penalty function†
- A SQP algorithm based on a smoothing lower order penalty function for inequality constrained optimization
- scientific article; zbMATH DE number 151663 (Why is no real title available?)
- Global convergence of an SQP algorithm for nonlinear optimization with overdetermined constraints
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- scientific article; zbMATH DE number 5583495 (Why is no real title available?)
- Sequential penalty algorithm for nonlinear constrained optimization
- A working set SQCQP algorithm with simple nonmonotone penalty parameters
- A trust region SQP-filter method for nonlinear second-order cone programming
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
This page was built for publication: A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954201)