On the global minimization of a convex function under general nonconvex constraints
From MaRDI portal
DOI10.1007/BF01443618zbMATH Open0657.90083MaRDI QIDQ1111474FDOQ1111474
Authors: Hoang Tuy, Nguyen Van Thuong 
Publication date: 1988
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3993310
- Global minimization of a concave function subject to mixed linear and reverse convex constraints
- Approximate global minimization of nonconvex functions that are close to convex
- scientific article; zbMATH DE number 3910151
- scientific article; zbMATH DE number 2210595
nonconvex optimizationconvergence proofpolyhedral approximationscontinuous inequality constraintsglobal optimization of nonconvex functions
Cites Work
- Convex Analysis
- Reverse convex programming
- Methods for Global Concave Minimization: A Bibliographic Survey
- An algorithm for nonconvex programming problems
- Title not available (Why is that?)
- The Validity of a Family of Optimization Methods
- Iterative Solution of Nonlinear Optimal Control Problems
- Complementary Geometric Programming
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- The complexity of analog computation
- A method for globally minimizing concave functions over convex sets
- Convex programs with an additional reverse convex constraint
- Linear programs with an additional reverse convex constraint
- Title not available (Why is that?)
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- Title not available (Why is that?)
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Characterization of local solutions for a class of nonconvex programs
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- Relationship between bilinear programming and concave minimization under linear constraints
- Title not available (Why is that?)
- On outer approximation methods for solving concave minimization problems
- Convex programs with several additional reverse convex constraints
- Title not available (Why is that?)
- Global minimization of a concave function subject to mixed linear and reverse convex constraints
- Stability property of a system of inequalities
Cited In (29)
- The search for a global minimum in problems of nonconvex programming with dependences that are biseparable superpositions of convex functions
- A d.c. optimization method for single facility location problems
- Duality and optimality conditions for reverse convex programs via a convex decomposition
- Linearly constrained global minimization of functions with concave minorants
- The complementary convex structure in global optimization
- On generalizing Takahashi's nonconvex minimization theorem
- Non-convex global optimization with Gurman perturbation
- On solving a d.c. programming problem by a sequence of linear programs
- Global optimization on convex sets
- A sequential convexification method (SCM) for continuous global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate global minimization of nonconvex functions that are close to convex
- Title not available (Why is that?)
- Existence of global minima for constrained optimization
- Global minimization of a generalized convex multiplicative function
- Difference of convex solution of quadratically constrained optimization problems.
- Minimizing the sum of a convex function and a specially structured nonconvex function
- Title not available (Why is that?)
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds
- A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications
- Title not available (Why is that?)
- Spherical harmonics-based pseudo-spectral method for quantitative analysis of symmetry breaking in wrinkling of shells with soft cores
- New necessary and sufficient optimality conditions for strong bilevel programming problems
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Beyond convex? global optimization is feasible only for convex objective functions: a theorem
- 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
This page was built for publication: On the global minimization of a convex function under general nonconvex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111474)
