The Cutting-Plane Method for Solving Convex Programs
From MaRDI portal
Publication:3277806
DOI10.1137/0108053zbMath0098.12104WikidataQ97724518 ScholiaQ97724518MaRDI QIDQ3277806
Publication date: 1961
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0108053
Related Items
Two-direction subgradient method for non-differentiable optimization problems, Cutting sphere algorithm, Using central prices in the decomposition of linear programs, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, On the convergence of a class of outer approximation algorithms for convex programs, Lower subdifferentiable functions and their minimization by cutting planes, A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems, On the global minimization of concave functions, Localization of multi-constrained optima and avoidance of local optima in structural optimization problems, Methods for solving multi-extremal problems (global search), About Lagrangian methods in integer optimization, Solving the \(p\)-median problem with a semi-Lagrangian relaxation, Robust capacity assignment in telecommunications, A matrix generation approach for eigenvalue optimization, A bundle modification strategy for convex minimization, A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization, Benders' decomposition for the constrained \(\ell_ 1\)-problem, Multi-level production scheduling for a class of flexible machining and assembly systems, Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems, An algorithm for linearly constrained convex nondifferentiable minimization problems, Solving general continuous single facility location problems by cutting planes, The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm, A subgradient selection method for minimizing convex functions subject to linear constraints, A constraint linearization method for nondifferentiable convex minimization, Outer approximation by polyhedral convex sets, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Partitioning procedures for solving mixed-variables programming problems, A strong duality theorem for the minimum of a family of convex programs, Reverse convex programming, A cutting-plane algorithm with linear and geometric rates of convergence, A maximization method for a class of quasiconcave programs, Un problema di approssimazione connesso con la sintesi di filtri digitali non ricorsivi, Optimal cargo allocation on board a plane: A sequential linear programming approach, Robustness of systems with uncertainties in the input, Investments in stochastic maximum flow networks, A converging algorithm for a linear exchange model, Discrete solutions to engineering design problems, Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems, A comparison of computational strategies for geometric programs, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Method of centers for minimizing generalized eigenvalues, A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix, Using an interior point method for the master problem in a decomposition approach, Mixed method for solving the general convex programming problem, Warm start of the primal-dual method applied in the cutting-plane scheme, A bundle-Newton method for nonsmooth unconstrained minimization, Stabilized column generation, A note on composite concave quadratic programming, A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix, Near-optimal control of nonstandard singularly perturbed systems, Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results, Convergence of some algorithms for convex minimization, Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning, Some outer approximation methods for semi-infinite optimization problems, On minimizing the largest eigenvalue of a symmetric matrix, Separating plane algorithms for convex optimization, Variable metric bundle methods: From conceptual to implementable forms, Utility function programs and optimization over the efficient set in multiple-objective decision making, D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Maximal closure on a graph with resource constraints, Method of simple-body centroids, Large-scale convex optimization methods for air quality policy assessment., A column generation approach to capacitated \(p\)-median problems, Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method, Uncertain convex programs: randomized solutions and confidence levels, A polyhedral branch-and-cut approach to global optimization, An effective line search for the subgradient method, Cutting angle methods in global optimization, Posynomial geometric programming as a special case of semi-infinite linear programming, Lagrangean relaxation. (With comments and rejoinder)., Numerical methods to design the reaching phase of output feedback variable structure control, Epigraphical nesting: A unifying theory for the convergence of algorithms, Deletion-by-infeasibility rule for DC-constrained global optimization, A logarithmic barrier cutting plane method for convex programming, On convex optimization with linear constraints, On numerical solution of hemivariational inequalities by nonsmooth optimization methods, A projection cutting plane algorithm for convex programming problems, A quasi-second-order proximal bundle algorithm, Canonical DC programming problem: Outer approximation methods revisited, A cutting plane method from analytic centers for stochastic programming, New variants of bundle methods, A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem, Tuning strategy for the proximity parameter in convex minimization, Lagrangian duality applied to the vehicle routing problem with time windows, A sequential cutting plane algorithm for solving convex NLP problems, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, A note on quasi convex programming, Algorithms for some minimax problems, Numerical computational methods of optimisation in control, A duality theorem and an algorithm for (mixed-) integer nonlinear programming, Cutting plane algorithms and state space constrained linear optimal control problems, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, A primal-proximal heuristic applied to the French unit-commitment problem, A proximal trust-region algorithm for column generation stabilization, A \(\mathcal{VU}\)-algorithm for convex minimization, An aggregate subgradient method for nonsmooth convex minimization, An extended model and a column generation algorithm for the planar multicommodity flow problem, Rapidly convergent modification of the method of chebyshev centers, DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS, Layout optimization of large‐scale pin‐jointed frames, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions, Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints, Unnamed Item, Unnamed Item, Zum heutigen Stand der nichtlinearen Optimierungstheorie, Indefinite cubic programming with standard errors in objective function, Programming with a special class of nonlinear functionals, An algorithm for linear optimal control systems with state-space constraints†, Penalty function versus non-penalty function methods for constrained nonlinear programming problems, Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I), A chance-constrained programming algorithm, Deux algorithmes de programmation mathématique, Level function method for quasiconvex programming., Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, ?-Subgradient mapping and the problem of convex optimization, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, A modified version of Tuy's method for solving d.c. programing problem, A cutting-plane method for quadratic semi infinite programming problems, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, A method for globally minimizing concave functions over convex sets, Two stage linear programming under uncertainty with 0–1 integer first stage variables, Convergence of a truncation method with deletion at each step, ALGORITHMS FOR OPTIMIZATION OF POWER SYSTEMS SCHEDULES BASED ON THE SIMPLEX METHOD, On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft, A central cutting plane algorithm for the convex programming problem, Unnamed Item, Approximate cutting planes in nonlinear programming, Simplicial decomposition in nonlinear programming algorithms, Computational aspects of cutting-plane algorithms for geometric programming problems, Algorithms for non-convexS n -games
