On the global minimization of a convex function under general nonconvex constraints
From MaRDI portal
Publication:1111474
DOI10.1007/BF01443618zbMath0657.90083MaRDI QIDQ1111474
Publication date: 1988
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
nonconvex optimization; convergence proof; polyhedral approximations; continuous inequality constraints; global optimization of nonconvex functions
Related Items
On solving a d.c. programming problem by a sequence of linear programs, The complementary convex structure in global optimization, New necessary and sufficient optimality conditions for strong bilevel programming problems, Difference of convex solution of quadratically constrained optimization problems., A d.c. optimization method for single facility location problems, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global minimization of a concave function subject to mixed linear and reverse convex constraints
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On outer approximation methods for solving concave minimization problems
- Convex programs with an additional reverse convex constraint
- The complexity of analog computation
- Convex programs with several additional reverse convex constraints
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Linear programs with an additional reverse convex constraint
- Reverse convex programming
- Relationship between bilinear programming and concave minimization under linear constraints
- Stability property of a system of inequalities
- Characterization of local solutions for a class of nonconvex programs
- Methods for Global Concave Minimization: A Bibliographic Survey
- A method for globally minimizing concave functions over convex sets
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- Complementary Geometric Programming
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- An algorithm for nonconvex programming problems
- Convex Analysis
- The Validity of a Family of Optimization Methods
- Iterative Solution of Nonlinear Optimal Control Problems
