A combined homotopy method under quasi-cone condition for non-convex nonlinear programming with equality and inequality constrains
From MaRDI portal
Publication:3501410
zbMATH Open1150.90450MaRDI QIDQ3501410FDOQ3501410
Authors: Yihua Yang, Liqin Zhao, Xianrui Lü, Shuyuan Liu, Zhao Song
Publication date: 3 June 2008
Recommendations
- A combined homotopy infeasible interior point method for nonconvex programming
- A homotopy method for solving nonconvex optimization with a weak quasi normal cone condition
- A combined homotopy method for nonconvex programming with unbounded feasible set
- Boundary moving combined homotopy method for nonconvex nonlinear programming
- Boundary moving combined homotopy method for nonconvex nonlinear programming and its convergence
Cited In (16)
- A method to construct a quasi-normal cone for a class of complexity non-convex sets and its applications in solving non-convex programming
- A combined homotopy method for nonconvex programming with unbounded feasible set
- Boundary moving combined homotopy method for nonconvex nonlinear programming and its convergence
- A homotopy method for solving nonconvex optimization with a weak quasi normal cone condition
- Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function
- A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems
- Dynamic constrained homotopy algorithms for solving extremum of functions in nonconvex domains with holes
- 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
- Boundary moving combined homotopy method for nonconvex nonlinear programming
- A spline smoothing homotopy method for nonconvex nonlinear programming
- The combined homotopy methods for optimization problem with partial reverse convex constraints
- Infeasible interior-point homotopy method for non-convex programming under normal cone condition
- A combined homotopy infeasible interior point method for nonconvex programming
- Construct a quasi-normal cone for nonconvex sets and its applications in solving nonconvex programming
This page was built for publication: A combined homotopy method under quasi-cone condition for non-convex nonlinear programming with equality and inequality constrains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3501410)