Convergent outer approximation algorithms for solving unary programs

DOI10.1023/A:1008284026289MaRDI QIDQ1273052zbMATH OpenOpenAlexFDO

Authors Reiner Horst, Ulrich Raber

Publication date 2 December 1998

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

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

zbMATH Keywords

multiextremal global optimizationcutting plane approachesindefinite quadratic constraintsindefinite quadratic functionsouter approximation algorithms

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• On the convergence of a class of outer approximation algorithms for convex programs
• Outer approximation algorithms for convex vector optimization problems
• Outer approximation algorithms for DC programs and beyond
• Outer-approximation algorithms for nonsmooth convex MINLP problems
• Outer approximation algorithms for pseudomonotone equilibrium problems
• Convergent Algorithms for a Class of Convex Semi-infinite Programs
• Outcome-space outer approximation algorithm for linear multiplicative programming
• Globally convergent algorithms for solving unconstrained optimization problems
• An outer approximation algorithm guaranteeing feasibility of solutions and approximate accuracy of optimality
• On complexity of unconstrained hyperbolic 0--1 programming problems

Cited in

(3)

• Logic Programming and Nonmonotonic Reasoning
• A global optimization algorithm using parametric linearization relaxation
• A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs

This page was built for publication: Convergent outer approximation algorithms for solving unary programs

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