Why a Pure Primal Newton Barrier Step May be Infeasible
From MaRDI portal
Publication:4764306
Recommendations
- On the complexity of the primal self-concordant barrier method.
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- scientific article; zbMATH DE number 686912
- Primal-dual interior point method based on a new barrier function
- General primal-dual penalty/barrier path-following Newton methods for nonlinear programming
- Convergence rate of primal dual reciprocal Barrier Newton interior-point methods
- Barrier method in nonsmooth convex optimization without convex representation
- scientific article; zbMATH DE number 1047683
- Stable barrier-projection and barrier-Newton methods in linear programming
- scientific article; zbMATH DE number 1070399
Cited in
(8)- Model order reduction with Galerkin projection applied to nonlinear optimization with infeasible primal-dual interior point method
- Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming.
- Local behavior of the Newton method on two equivalent systems from linear programming
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- A general class of penalty/barrier path-following Newton methods for nonlinear programming
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- New theoretical results on recursive quadratic programming algorithms
This page was built for publication: Why a Pure Primal Newton Barrier Step May be Infeasible
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764306)
