A globally convergent interior point algorithm for non-convex nonlinear programming
DOI10.1016/J.CAM.2008.05.043zbMATH Open1163.90030OpenAlexW2031840918MaRDI QIDQ1002202FDOQ1002202
Authors: Xiaona Fan 
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
Recommendations
- Globally convergent interior-point algorithm for nonlinear programming
- On the global convergence of interior-pointnonlinear programming algorithms
- An interior-point algorithm for nonconvex nonlinear programming
- A feasible interior-point algorithm for nonconvex nonlinear programming
- Global convergence of an interior-point potential reduction algorithm for nonlinear programming problems
- scientific article; zbMATH DE number 269555
- A globally convergent primal-dual interior point algorithm for convex programming
- Global convergence of the Newton interior-point method for nonlinear programming
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- Global convergence of a primal-dual interior-point method for nonlinear programming
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)
Cites Work
- A new polynomial-time algorithm for linear programming
- On some efficient interior point methods for nonlinear convex programming
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- Title not available (Why is that?)
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
- Theory of globally convergent probability-one homotopies for nonlinear programming
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- Interior-point methods for convex programming
- Title not available (Why is that?)
Cited In (13)
- Title not available (Why is that?)
- A feasible interior-point algorithm for nonconvex nonlinear programming
- A globally convergent regularized interior point method for constrained optimization
- A globally convergent non-interior point algorithm with full Newton step for second-order cone programming
- Failure of global convergence for a class of interior point methods for nonlinear programming
- A polynomial path following algorithm for convex programming
- A globally convergent non-interior point homotopy method for solving variational inequalities
- A globally convergent version of a general recursive algorithm for nonlinear programming
- A constraint shifting homotopy method for general non-linear programming
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- Local convergence of the affine-scaling interior-point algorithm for nonlinear programming
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- A combined homotopy interior point algorithm for a class of unbounded non-convex optimization problems
This page was built for publication: A globally convergent interior point algorithm for non-convex nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1002202)
