A continuous method for solving nonconvex optimization problem
From MaRDI portal
Publication:4926558
zbMATH Open1274.90279MaRDI QIDQ4926558FDOQ4926558
Authors: Hongliang Shu, Chunyang Zhang 
Publication date: 20 June 2013
Recommendations
- scientific article; zbMATH DE number 1816759
- A combined homotopy infeasible interior point method for nonconvex programming
- Homotopy method for getting a local minimum of a class of non-convex programming
- Convergence theorems of the homotopy method for nonconvex programming in unbounded sets
- Solving a class of nonlinear programming problems via a homotopy continuation method
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Cited In (8)
- A fast continuous time approach with time scaling for nonsmooth convex optimization
- A new method for nonsmooth convex optimization
- Solving a class of nonlinear programming problems via a homotopy continuation method
- Dynamic constrained homotopy algorithms for solving extremum of functions in nonconvex domains with holes
- Dynamic constraint homotopy algorithm for solving a class of extremum problem of function
- Title not available (Why is that?)
- On the calculation of a feasible point of a nonconvex set: pathfollowing with jumps
- Title not available (Why is that?)
This page was built for publication: A continuous method for solving nonconvex optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4926558)
