A combined homotopy interior point method for convex nonlinear programming
From MaRDI portal
Publication:1368923
DOI10.1016/S0096-3003(96)00086-0zbMath0898.90100MaRDI QIDQ1368923
Zhenghua Lin, Bo Yu, Guo-Chen Feng
Publication date: 7 October 1997
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Related Items
A homotopy method for getting a local minimum of constrained nonconvex programming, A combined homotopy interior point method for general nonlinear programming problems, A combined homotopy interior point method for the linear complementarity problem, On the complexity of a combined homotopy interior method for convex programming, Finding a minimal efficient solution of a convex multiobjective program, Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition, A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints, Homotopy interior-point method for a general multiobjective programming problem, A noninterior path following algorithm for solving a class of multiobjective programming problems, Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming, A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming, Homotopy method for a general multiobjective programming problem, A polynomial path following algorithm for convex programming, A constraint shifting homotopy method for general non-linear programming, Truncated aggregate homotopy method for nonconvex nonlinear programming, The aggregate constraint homotopy method for nonconvex nonlinear programming, A continuation method for solving convex programming problemsviafischer reformulation, Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set, A smoothing homotopy method for solving variational inequalities, A spline smoothing homotopy method for nonconvex nonlinear programming, Globally convergent method for designing twice spline contractual function, A continuation method for solving fixed points of self-mappings in general nonconvex sets, Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- A new polynomial-time algorithm for linear programming
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- On some efficient interior point methods for nonlinear convex programming
- Interior-point methods for convex programming
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- An implementation of Karmarkar's algorithm for linear programming
- A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- 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
- A path following algorithm for a class of convex programming problems
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
