A quadratically convergent scaling newton’s method for nonlinear programming problems
From MaRDI portal
Recommendations
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems
- Newton-type methods for nonlinearly constrained programming problems-algorithms and theory
- Quasi-Newton methods for solving nonlinear programming problems
- On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
- Newton's method for constrained optimization
Cites work
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- An Interior-Point Algorithm for Linearly Constrained Optimization
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
- The Projective SUMT Method for Convex Programming
Cited in
(4)- An exterior Newton method for strictly convex quadratic programming
- Solving quadratic programs to high precision using scaled iterative refinement
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems
This page was built for publication: A quadratically convergent scaling newton’s method for nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944414)