An outer approximation algorithm guaranteeing feasibility of solutions and approximate accuracy of optimality

DOI10.1023/A:1008343426871MaRDI QIDQ1304754zbMATH OpenOpenAlexFDO

Authors Syuuji Yamada, Tamaki Tanaka

Publication date 22 September 1999

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008343426871

zbMATH Keywords

compact convex feasible setconcave programmingcutting plane methodglobal optimizationouter approximation methodsupporting hyperplane method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On the convergence of a class of outer approximation algorithms for convex programs
• Outer approximation method incorporating a quadratic approximation for a DC programming problem
• On outer approximation methods for solving concave minimization problems
• A branch and bound-outer approximation algorithm for concave minimization over a convex set
• Outer approximation by polyhedral convex sets

Cited in

(6)

• Convergent outer approximation algorithms for solving unary programs
• One approach for solving optimization problems with apriori estimates of approximation of admissible set
• A Two-Riccati, Feasible Algorithm for Guaranteeing Output L∞ Constraints
• scientific article; zbMATH DE number 1530351 (Why is no real title available?)
• scientific article; zbMATH DE number 2182581 (Why is no real title available?)
• On the use of outer approximations as an external active set strategy

This page was built for publication: An outer approximation algorithm guaranteeing feasibility of solutions and approximate accuracy of optimality

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