On an outer approximation concept in global optimization

DOI10.1080/02331938908843440zbMath0675.90077OpenAlexW1989123681MaRDI QIDQ3830824

Nguyen Van Thoai, Hoang Tuy, Reiner Horst

Publication date: 1989

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938908843440

zbMATH Keywords

cutting planespolyhedral setsconstraint dropping strategiesnonlinear cutsunbounded feasible setsgeneral outer approximation algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Mathematical programming (90C99)

Related Items

Global optimization conditions for certain nonconvex minimization problems, Deletion-by-infeasibility rule for DC-constrained global optimization, On solving general reverse convex programming problems by a sequence of linear programs and line searches, On finding new vertices and redundant constraints in cutting plane algorithms for global optimization, 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, A global optimization approach for solving the convex multiplicative programming problem, Concave minimization via conical partitions and polyhedral outer approximation

Cites Work

• On the convergence of a class of outer approximation algorithms for convex programs
• Convex programs with an additional reverse convex constraint
• Outer approximation by polyhedral convex sets
• Newton's method for convex programming and Tschebyscheff approximation
• Outer approximation algorithm for nondifferentiable optimization problems
• Global optimization under Lipschitzian constraints
• A modified version of Tuy's method for solving d.c. programing problem
• A method for globally minimizing concave functions over convex sets
• An Outer Approximation Algorithm for Solving General Convex Programs
• 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