Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
From MaRDI portal
Recommendations
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
- A new constraints identification technique-based QP-free algorithm for the solution of inequality constrained minimization problems.
Cites work
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- A Feasible Sequential Linear Equation Method 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 Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A computationally efficient feasible sequential quadratic programming algorithm
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- An SQP method for general nonlinear programs using only equality constrained subproblems
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- Failure of global convergence for a class of interior point methods for nonlinear programming
- Feasible direction interior-point technique for nonlinear optimization
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- Interior Methods for Nonlinear Optimization
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- New active set identification for general constrained optimization and minimax problems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- On the Accurate Identification of Active Constraints
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- Sequential systems of linear equations method for general constrained optimization without strict complementarity
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- Test examples for nonlinear programming codes
Cited in
(2)
This page was built for publication: Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407660)
