Cutting-Plane Methods without Nested Constraint Sets
From MaRDI portal
Publication:5605015
DOI10.1287/opre.18.3.404zbMath0205.21903OpenAlexW2151462369MaRDI QIDQ5605015
Publication date: 1970
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.18.3.404
Related Items
The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm, Some outer approximation methods for semi-infinite optimization problems, Outer approximation by polyhedral convex sets, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, A cutting-plane algorithm with linear and geometric rates of convergence, Methods of embedding-cutting off in problems of mathematical programming, Investments in stochastic maximum flow networks, A central cutting plane algorithm for the convex programming problem, A cutting-plane method for quadratic semi infinite programming problems, Convergence bounds for nonlinear programming algorithms, Una clase de problemas de decision bajo incertidumbre parcial, Problemas de decision en incertidumbre parcial bajo hipotesis de monotonias, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, On an outer approximation concept in global optimization, Rates of convergence for a method of centers algorithm, Infinitely constrained optimization problems, Computational aspects of cutting-plane algorithms for geometric programming problems, Minimization methods with constraints, Convergence of a truncation method with deletion at each step, Cutting plane algorithms and state space constrained linear optimal control problems, On cutoff optimization methods in infinite-dimensional spaces and applications, A two-stage cutting-plane method for conditional minimizing function, Lower subdifferentiable functions and their minimization by cutting planes, Applications of a general convergence theory for outer approximation algorithms
