Extended reverse-convex programming: an approximate enumeration approach to global optimization
From MaRDI portal
(Redirected from Publication:288222)
Abstract: A new approach to solving a large class of factorable nonlinear programming (NLP) problems to global optimality is presented in this paper. Unlike the traditional strategy of partitioning the decision-variable space employed in many branch-and-bound methods, the proposed approach approximates the NLP problem by a reverse-convex programming (RCP) problem to a controlled precision, with the latter then solved by an enumerative search. To establish the theoretical guarantees of the method, the notion of "RCP regularity" is introduced and it is proven that enumeration is guaranteed to yield a global optimum when the RCP problem is regular. An extended RCP algorithmic framework is then presented and its performance is examined for a small set of test problems.
Recommendations
- Global optimization of nonconvex factorable programming problems
- Global optimization for special reverse convex programming
- Testing the \({\mathfrak R}\)-strategy for a reverse convex problem
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- A nonisolated optimal solution for special reverse convex programming problems
Cites work
- scientific article; zbMATH DE number 3422216 (Why is no real title available?)
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- A comparison of complete global optimization solvers
- An Algorithm for Separable Nonconvex Programming Problems
- An efficient algorithm for determining the convex hull of a finite planar set
- Branching rules revisited
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Concave programming and piece-wise linear programming
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex factorable programming problems
- Global optimization problems and domain reduction strategies
- Graph implementations for nonsmooth convex programs
- Handbook of test problems in local and global optimization
- Introduction to global optimization
- Jointly Constrained Biconvex Programming
- Letters to the editor. A new calculus for optimum design
- Methods for Global Concave Minimization: A Bibliographic Survey
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Reverse convex programming
- The Piecewise Concave Function
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(2)
This page was built for publication: Extended reverse-convex programming: an approximate enumeration approach to global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288222)
