An improved feasible QP-free algorithm for inequality constrained optimization
From MaRDI portal
Recommendations
- A new type feasible QP-free algorithm for inequality constrained optimization
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
- A new QP-free algorithm for inequality constrained optimization without strict complementarity
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
- An improved SQP algorithm for inequality constrained optimization
- An efficient feasible SQP algorithm for inequality constrained optimization
- A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
- An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
- A simple feasible SQP algorithm for inequality constrained optimization
Cites work
- A fast convergent algorithm of sequential systems of linear equations for inequality constrained optimization without strict complementarity
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A feasible equality constrained SQP algorithm for nonlinear optimization
- A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
- A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A sequential quadratic programming method for potentially infeasible mathematical programs
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- Test examples for nonlinear programming codes
Cited in
(13)- An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
- A kind of QP-free feasible method
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- A new QP-free algorithm for inequality constrained optimization without strict complementarity
- Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization
- A new constraints identification technique-based QP-free algorithm for the solution of inequality constrained minimization problems.
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
- A new type feasible QP-free algorithm for inequality constrained optimization
- An infeasible active-set QP-free algorithm for general nonlinear programming
- A new globally and superlinearly convergent QP-free method for inequality constrained optimization
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
This page was built for publication: An improved feasible QP-free algorithm for inequality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941312)
