A combined homotopy infeasible interior point method for nonconvex programming
From MaRDI portal
(Redirected from Publication:4906121)
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
Cited in
(32)- A combined homotopy interior point method for general nonlinear programming problems
- A combined homotopy interior point method for convex nonlinear programming
- A modified homotopy method for solving the principal-agent bilevel programming problem
- A noninterior point homotopy method for semi-infinite programming problems
- Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming
- A homotopy method for nonlinear second-order cone programming
- Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function
- A spline smoothing homotopy method for nonconvex nonlinear programming
- Convergence theorems of homotopy method for constrained nonconvex programming
- scientific article; zbMATH DE number 5943354 (Why is no real title available?)
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- Boundary moving combined homotopy method for nonconvex nonlinear programming and its convergence
- A combined maximum entropy homotopy method for solving the K-K-T point of a class of nonconvex nonlinear programming problems
- A combined homotopy method under quasi-cone condition for non-convex nonlinear programming with equality and inequality constrains
- Infeasible interior-point homotopy method for non-convex programming under normal cone condition
- A method to construct a quasi-normal cone for a class of complexity non-convex sets and its applications in solving non-convex programming
- The combined homotopy methods for optimization problem with partial reverse convex constraints
- scientific article; zbMATH DE number 1186903 (Why is no real title available?)
- scientific article; zbMATH DE number 1789811 (Why is no real title available?)
- A combined homotopy method for nonconvex programming with unbounded feasible set
- A continuous method for solving nonconvex optimization problem
- Shifting constraints combined homotopy methods for a class of optimization problems
- A combined homotopy interior point algorithm for a class of unbounded non-convex optimization problems
- A constraint shifting homotopy method for general non-linear programming
- Homotopy method for getting a local minimum of a class of non-convex programming
- Boundary moving combined homotopy method for nonconvex nonlinear programming
- A combined homotopy infeasible interior-point method for convex nonlinear programming
- Truncated aggregate homotopy method for nonconvex nonlinear programming
- On the calculation of a feasible point of a nonconvex set: pathfollowing with jumps
- A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
- A homotopy method for getting a local minimum of constrained nonconvex programming
- On the complexity of a combined homotopy interior method for convex programming
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)
