On an outer approximation concept in global optimization

DOI10.1080/02331938908843440MaRDI QIDQ3830824zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 5989987
• On outer approximation methods for solving concave minimization problems
• An outer approximation method for globally minimizing a concave function over a compact convex set
• scientific article; zbMATH DE number 4051358
• scientific article; zbMATH DE number 1530351
• Some outer approximation methods for semi-infinite optimization problems
• scientific article; zbMATH DE number 4131966
• scientific article; zbMATH DE number 569896
• A VARIANT OF THE OUTER APPROXIMATION METHOD FOR GLOBALLY MINIMIZING A CLASS OF COMPOSITE FUNCTIONS
• scientific article; zbMATH DE number 1225234

Cites work

• A Successive Underestimation Method for Concave Minimization Problems
• A method for globally minimizing concave functions over convex sets
• A modified version of Tuy's method for solving d.c. programing problem
• An Outer Approximation Algorithm for Solving General Convex Programs
• Applications of a general convergence theory for outer approximation algorithms
• Convex Analysis
• Convex programs with an additional reverse convex constraint
• Cutting-Plane Methods without Nested Constraint Sets
• Global optimization under Lipschitzian constraints
• Newton's method for convex programming and Tschebyscheff approximation
• On the convergence of a class of outer approximation algorithms for convex programs
• Outer approximation algorithm for nondifferentiable optimization problems
• Outer approximation by polyhedral convex sets
• The Supporting Hyperplane Method for Unimodal Programming

Cited in

(15)

• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• scientific article; zbMATH DE number 1530351 (Why is no real title available?)
• On the use of outer approximations as an external active set strategy
• A global optimization approach for solving the convex multiplicative programming problem
• Deletion-by-infeasibility rule for DC-constrained global optimization
• On solving a d.c. programming problem by a sequence of linear programs
• Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
• Concave minimization via conical partitions and polyhedral outer approximation
• Global optimization conditions for certain nonconvex minimization problems
• A new simplicial cover technique in constrained global optimization
• scientific article; zbMATH DE number 5989987 (Why is no real title available?)
• Global optimization: a machine learning approach
• On outer approximation methods for solving concave minimization problems
• scientific article; zbMATH DE number 4051358 (Why is no real title available?)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches

This page was built for publication: On an outer approximation concept in global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3830824)