A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
DOI10.1016/J.AMC.2015.05.091zbMATH Open1410.90201OpenAlexW578745989MaRDI QIDQ669396FDOQ669396
Huaqin Pan, Jinbao Jian, Chun-Ming Tang, Jian-Ling Li
Publication date: 15 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.05.091
Recommendations
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
- A superlinearly convergent feasible interior point algorithm for inequality constrained optimization
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
nonlinear optimizationinequality constraintssuperlinear convergencequasi interior-point methodstrongly sub-feasible method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)
Cites Work
- CUTEr and SifDec
- On the Accurate Identification of Active Constraints
- A QP-free constrained Newton-type method for variational inequality problems
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- A computationally efficient feasible sequential quadratic programming algorithm
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
Cited In (8)
- Title not available (Why is that?)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- Z-type neural-dynamics for time-varying nonlinear optimization under a linear equality constraint with robot application
- A global QP-free algorithm for mathematical programs with complementarity constraints
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints
- A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach
Uses Software
This page was built for publication: A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669396)
