Outer approximation by polyhedral convex sets

DOI10.1007/BF01721096zbMath0642.90094MaRDI QIDQ1101351

Hoang Tuy, Nguyen Van Thoai, Reiner Horst

Publication date: 1987

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

outer approximationpolyhedral convex setsmultiextremal global optimizationconstraint dropping strategiescut map-separator theory

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31)

Related Items (21)

Constraint decomposition algorithms in global optimization ⋮ A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem ⋮ On solving general reverse convex programming problems by a sequence of linear programs and line searches ⋮ Utility function programs and optimization over the efficient set in multiple-objective decision making ⋮ An algorithm for maximizing a convex function over a simple set ⋮ Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems ⋮ DC programming: overview. ⋮ A combined cutting-stock and lot-sizing problem ⋮ A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem ⋮ On solving a d.c. programming problem by a sequence of linear programs ⋮ A new simplicial cover technique in constrained global optimization ⋮ Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type ⋮ On an outer approximation concept in global optimization ⋮ A global optimization approach for solving the convex multiplicative programming problem ⋮ Linear multiplicative programming ⋮ Separable concave minimization via partial outer approximation and branch and bound ⋮ A criterion for an approximation global optimal solution based on the filled functions ⋮ A branch and bound-outer approximation algorithm for concave minimization over a convex set ⋮ A relaxed projection method for finite-dimensional equilibrium problems ⋮ Global minimization of a generalized convex multiplicative function ⋮ Concave minimization via conical partitions and polyhedral outer approximation

Cites Work

• On the convergence of a class of outer approximation algorithms for convex programs
• Newton's method for convex programming and Tschebyscheff approximation
• Outer approximation algorithm for nondifferentiable optimization problems
• The Cutting-Plane Method for Solving Convex Programs
• A method for globally minimizing concave functions over convex sets
• An Outer Approximation Algorithm for Solving General Convex Programs
• Approximate cutting planes in nonlinear programming
• A Successive Underestimation Method for Concave Minimization Problems
• Applications of a general convergence theory for outer approximation algorithms
• The Supporting Hyperplane Method for Unimodal Programming
• Convex Analysis
• Cutting-Plane Methods without Nested Constraint Sets

This page was built for publication: Outer approximation by polyhedral convex sets