A new global optimization algorithm for solving a class of nonconvex programming problems
Summary: A new two-part parametric linearization technique is proposed globally to a class of nonconvex programming problems (NPP). Firstly, a two-part parametric linearization method is adopted to construct the underestimator of objective and constraint functions, by utilizing a transformation and a parametric linear upper bounding function (LUBF) and a linear lower bounding function (LLBF) of a natural logarithm function and an exponential function with \(e\) as the base, respectively. Then, a sequence of relaxation lower linear programming problems, which are embedded in a branch-and-bound algorithm, are derived in an initial nonconvex programming problem. The proposed algorithm is converged to global optimal solution by means of a subsequent solution to a series of linear programming problems. Finally, some examples are given to illustrate the feasibility of the presented algorithm.
- scientific article; zbMATH DE number 5583854
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- A new accelerating method for globally solving a class of nonconvex programming problems
- A branch and bound algorithm for a class of non-convex programming problems
- A new version of the Price's algorithm for global optimization
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A globally convergent version of a general recursive algorithm for nonlinear programming
- scientific article; zbMATH DE number 2058467 (Why is no real title available?)
- scientific article; zbMATH DE number 1795203 (Why is no real title available?)
- A Global Algorithm for Nonlinear Semidefinite Programming
- scientific article; zbMATH DE number 5583854 (Why is no real title available?)
- A new “Optimization‐Preserving‐Operator” applied to global optimization
- Global optimization of nonconvex factorable programming problems
- A modification to the new version of the Price's algorithm for continuous global optimization problems
- A new accelerating method for globally solving a class of nonconvex programming problems
- A new heuristic approach for non-convex optimization problems
This page was built for publication: A new global optimization algorithm for solving a class of nonconvex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714710)
