Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs
From MaRDI portal
Publication:4896436
Recommendations
Cited in
(12)- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms
- scientific article; zbMATH DE number 5152474 (Why is no real title available?)
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- scientific article; zbMATH DE number 5630197 (Why is no real title available?)
- scientific article; zbMATH DE number 724216 (Why is no real title available?)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming
- Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
- A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
This page was built for publication: Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896436)