A globally convergent interior point algorithm for non-convex nonlinear programming
Publication:1002202
DOI10.1016/J.CAM.2008.05.043zbMath1163.90030OpenAlexW2031840918MaRDI QIDQ1002202
Publication date: 25 February 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.05.043
Probabilistic models, generic numerical methods in probability and statistics (65C20) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for initial value problems involving ordinary differential equations (65L05)
Related Items (1)
Cites Work
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- A new polynomial-time algorithm for linear programming
- On some efficient interior point methods for nonlinear convex programming
- Interior-point methods for convex programming
- The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- The Projective SUMT Method for Convex Programming
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A globally convergent interior point algorithm for non-convex nonlinear programming
