Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
From MaRDI portal
Recommendations
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- New theoretical results on recursive quadratic programming algorithms
- scientific article; zbMATH DE number 7590223
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
Cites work
- A Robust Trust Region Method for Constrained Nonlinear Programming Problems
- A nonsmooth version of Newton's method
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- A robust sequential quadratic programming method
- A sequential quadratic programming method for potentially infeasible mathematical programs
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Minimization of \(SC^ 1\) functions and the Maratos effect
- New Results on a Continuously Differentiable Exact Penalty Function
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Semismooth and Semiconvex Functions in Constrained Optimization
Cited in
(21)- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- Sequential systems of linear equations method for general constrained optimization without strict complementarity
- Constraint incorporation in optimization
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- Sequential penalty algorithm for nonlinear constrained optimization
- A robust SQP method based on a smoothing lower order penalty function†
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- A SQP method for inequality constrained optimization.
- Minimization of \(SC^ 1\) functions and the Maratos effect
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty
- A sequential quadratically constrained quadratic programming method of feasible directions
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- Dynamic response optimization using an active set RQP algorithm
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
This page was built for publication: Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356094)
