Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
From MaRDI portal
Publication:5638135
DOI10.1287/opre.18.6.1216zbMath0229.90043OpenAlexW2008737905MaRDI QIDQ5638135
Publication date: 1970
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.18.6.1216
Related Items
Some outer approximation methods for semi-infinite optimization problems, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, A cutting-plane algorithm with linear and geometric rates of convergence, A central cutting plane algorithm for the convex programming problem, Una clase de problemas de decision bajo incertidumbre parcial, Problemas de decision en incertidumbre parcial bajo hipotesis de monotonias, Infinitely constrained optimization problems, Computational aspects of cutting-plane algorithms for geometric programming problems, On cutoff optimization methods in infinite-dimensional spaces and applications, Lower subdifferentiable functions and their minimization by cutting planes, Applications of a general convergence theory for outer approximation algorithms
