Convergence theorems of the homotopy method for nonconvex programming in unbounded sets
From MaRDI portal
Publication:4928048
zbMATH Open1274.90281MaRDI QIDQ4928048FDOQ4928048
Authors: Wenjuan Sun, Cai-ling Wang 
Publication date: 20 June 2013
Recommendations
- scientific article; zbMATH DE number 2164053
- Convergence theorems of homotopy method for constrained nonconvex programming
- A combined homotopy method for nonconvex programming with unbounded feasible set
- Homotopy method for getting a local minimum of a class of non-convex programming
- Homotopy method for getting a local minimum of unconstrained non-convex programming
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Cited In (11)
- 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
- Condition for global convergence of a homotopy method for variational inequality problems on unbounded sets
- A homotopy method for getting a local minimum of constrained nonconvex programming
- Solving a class of nonlinear programming problems via a homotopy continuation method
- Title not available (Why is that?)
- A continuation method for solving K-K-T points of general unbounded nonconvex programming problems
- Title not available (Why is that?)
- Homotopy method for getting a local minimum of unconstrained non-convex programming
- Homotopy method for getting a local minimum of a class of non-convex programming
This page was built for publication: Convergence theorems of the homotopy method for nonconvex programming in unbounded sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928048)
