Applications of a general convergence theory for outer approximation algorithms

DOI10.1007/BF01580118zbMath0283.90058OpenAlexW1970676206MaRDI QIDQ4770226

William W. Hogan

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580118

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Some outer approximation methods for semi-infinite optimization problems, Outer approximation by polyhedral convex sets, A cutting-plane algorithm with linear and geometric rates of convergence, On the monotone convergence of algorithmic models, On an outer approximation concept in global optimization, Infinitely constrained optimization problems, An outer-approximation guided optimization approach for constrained neural network inverse problems

Cites Work

• Unnamed Item
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Convex Analysis
• The Validity of a Family of Optimization Methods
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
• Cutting-Plane Methods without Nested Constraint Sets
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
• Point-to-Set Maps in Mathematical Programming