Convex minimization under Lipschitz constraints
From MaRDI portal
Publication:1823144
DOI10.1007/BF00939426zbMath0679.90048MaRDI QIDQ1823144
Publication date: 1990
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
Deterministic methods in constrained global optimization: Some recent advances and new fields of application ⋮ On nonconvex optimization problems with separated nonconvex variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Convex programs with several additional reverse convex constraints
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- The design centering problem as a d.c. programming problem
- Linear programs with an additional reverse convex constraint
- Reverse convex programming
- Generalized Benders decomposition
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Global minimization of a difference of two convex functions
- Global optimization under Lipschitzian constraints
- A method for globally minimizing concave functions over convex sets
- Convergent Algorithms for Minimizing a Concave Function
- An algorithm for nonconvex programming problems
- A Successive Underestimation Method for Concave Minimization Problems
This page was built for publication: Convex minimization under Lipschitz constraints
