A combined homotopy infeasible interior point method for nonconvex programming

zbMATH Open1257.49032MaRDI QIDQ4906121FDOQ4906121

Authors: Li Yang, Bo Yu, Qing Xu 

Publication date: 7 February 2013

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol8/p89.html

Recommendations

• A combined homotopy method under quasi-cone condition for non-convex nonlinear programming with equality and inequality constrains
• A combined homotopy method for nonconvex programming with unbounded feasible set
• A combined homotopy infeasible interior-point method for convex nonlinear programming
• Boundary moving combined homotopy method for nonconvex nonlinear programming and its convergence
• Convergence theorems of homotopy method for constrained nonconvex programming

zbMATH Keywords

global convergencenonconvex programminginterior point methodhomotopy methodinfeasible interior point method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cited In (31)

• A method to construct a quasi-normal cone for a class of complexity non-convex sets and its applications in solving non-convex programming
• Shifting constraints combined homotopy methods for a class of optimization problems
• A combined homotopy method for nonconvex programming with unbounded feasible set
• Convergence theorems of homotopy method for constrained nonconvex programming
• A continuous method for solving nonconvex optimization problem
• A homotopy method for getting a local minimum of constrained nonconvex programming
• Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
• On the complexity of a combined homotopy interior method for convex programming
• Boundary moving combined homotopy method for nonconvex nonlinear programming and its convergence
• A noninterior point homotopy method for semi-infinite programming problems
• A combined homotopy infeasible interior-point method for convex nonlinear programming
• A combined homotopy interior point method for convex nonlinear programming
• Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
• A homotopy method for nonlinear second-order cone programming
• Title not available (Why is that?)
• A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
• A modified homotopy method for solving the principal-agent bilevel programming problem
• Boundary moving combined homotopy method for nonconvex nonlinear programming
• A spline smoothing homotopy method for nonconvex nonlinear programming
• A combined maximum entropy homotopy method for solving the K-K-T point of a class of nonconvex nonlinear programming problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A constraint shifting homotopy method for general non-linear programming
• The combined homotopy methods for optimization problem with partial reverse convex constraints
• Truncated aggregate homotopy method for nonconvex nonlinear programming
• On the calculation of a feasible point of a nonconvex set: pathfollowing with jumps
• A combined homotopy method under quasi-cone condition for non-convex nonlinear programming with equality and inequality constrains
• Homotopy method for getting a local minimum of a class of non-convex programming
• Infeasible interior-point homotopy method for non-convex programming under normal cone condition
• A combined homotopy interior point algorithm for a class of unbounded non-convex optimization problems

This page was built for publication: A combined homotopy infeasible interior point method for nonconvex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906121)