The Cutting-Plane Method for Solving Convex Programs
From MaRDI portal
Publication:3277806
DOI10.1137/0108053zbMath0098.12104OpenAlexW2069808690WikidataQ97724518 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
Indefinite cubic programming with standard errors in objective function, An Algorithm to Construct Subsolutions of Convex Optimal Control Problems, Learning Optimized Risk Scores, A new Lagrangian-Benders approach for a concave cost supply chain network design problem, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, Convergent Algorithms for a Class of Convex Semi-infinite Programs, A Benson-type algorithm for bounded convex vector optimization problems with vertex selection, Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints, Using projected cutting planes in the extended cutting plane method, DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, Programming with a special class of nonlinear functionals, Single Allocation Hub Location with Heterogeneous Economies of Scale, ?-Subgradient mapping and the problem of convex optimization, A Scalable Algorithm for Sparse Portfolio Selection, An algorithm for linear optimal control systems with state-space constraints†, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, A computational study of perspective cuts, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, A conflict-directed approach to chance-constrained mixed logical linear programming, Minimum capital requirement and portfolio allocation for non-life insurance: a semiparametric model with conditional value-at-risk (CVaR) constraint, On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs, Risk budgeting portfolios from simulations, Nonconvex sensitivity-based generalized Benders decomposition, A survey on mixed-integer programming techniques in bilevel optimization, Penalty function versus non-penalty function methods for constrained nonlinear programming problems, A solution algorithm for chance-constrained problems with integer second-stage recourse decisions, Scenario decomposable subgradient projection method for two-stage stochastic programming with convex risk measures, Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I), A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, A chance-constrained programming algorithm, An Optimal First Order Method Based on Optimal Quadratic Averaging, Linear Programming on the Stiefel Manifold, 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, Deux algorithmes de programmation mathématique, Regularized Decomposition of High-Dimensional Multistage Stochastic Programs with Markov Uncertainty, Unnamed Item, Unnamed Item, Robust Spectral Risk Optimization When Information on Risk Spectrum Is Incomplete, A central cutting plane algorithm for the convex programming problem, Unnamed Item, A modified version of Tuy's method for solving d.c. programing problem, A cutting-plane method for quadratic semi infinite programming problems, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, Unnamed Item, Layout optimization of large‐scale pin‐jointed frames, Level function method for quasiconvex programming., Approximate cutting planes in nonlinear programming, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, Improving parameter estimation using constrained optimization methods, Outer-approximation algorithms for nonsmooth convex MINLP problems, Simplicial decomposition in nonlinear programming algorithms, An extended model and a column generation algorithm for the planar multicommodity flow problem, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Approximation of reachable sets by direct solution methods for optimal control problems, Computational aspects of cutting-plane algorithms for geometric programming problems, Fast computation of the leastcore and prenucleolus of cooperative games, Algorithms for non-convexS n -games, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, A method for globally minimizing concave functions over convex sets, Two stage linear programming under uncertainty with 0–1 integer first stage variables, Capacity expansion under a service-level constraint for uncertain demand with lead times, Essentials of numerical nonsmooth optimization, Discrete Approximation and Quantification in Distributionally Robust Optimization, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, Modeling and Managing Uncertainty in Process Planning and Scheduling, Convergence of a truncation method with deletion at each step, Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods, Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity, On the generalization of ECP and OA methods to nonsmooth convex MINLP problems, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Sparse Convex Regression, Bicriteria Data Compression, Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions, Parallel bucket sorting on graphics processing units based on convex optimization, A splitting bundle approach for non-smooth non-convex minimization, An aggregate homotopy method for solving unconstrained minimax problems, Rapidly convergent modification of the method of chebyshev centers, Unnamed Item, Algorithms for Simple Bilevel Programming, Essentials of numerical nonsmooth optimization, Zum heutigen Stand der nichtlinearen Optimierungstheorie, Large-scale optimization with the primal-dual column generation method, An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems, Cutting-plane method based on epigraph approximation with discarding the cutting planes, Solving general continuous single facility location problems by cutting planes, BoxStep methods for crew pairing problems, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, 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 robust optimization approach to energy and reserve dispatch in electricity markets, A constraint linearization method for nondifferentiable convex minimization, Benders decomposition without separability: a computational study for capacitated facility location problems, Outer approximation by polyhedral convex sets, Solving the \(p\)-median problem with a semi-Lagrangian relaxation, An optimal variant of Kelley's cutting-plane method, Metabolic cost of neuronal information in an empirical stimulus-response model, Robust capacity assignment in telecommunications, A matrix generation approach for eigenvalue optimization, A bundle modification strategy for convex minimization, The proximal Chebychev center cutting plane algorithm for convex additive functions, Cutting sphere algorithm, A hybrid approach of bundle and Benders applied large mixed linear integer problem, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Implementing the simplex method as a cutting-plane method, with a view to regularization, A feasible directions method for nonsmooth convex optimization, A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization, Partitioning procedures for solving mixed-variables programming problems, A strong duality theorem for the minimum of a family of convex programs, \(\mathrm{M}^4\mathrm{L}\): maximum margin multi-instance multi-cluster learning for scene modeling, Analysis of stochastic dual dynamic programming method, Approximate level method for nonsmooth convex minimization, Reverse convex programming, A cutting-plane algorithm with linear and geometric rates of convergence, Multi-instance multi-label learning, A maximization method for a class of quasiconcave programs, Managing capacity flexibility in make-to-order production environments, Un problema di approssimazione connesso con la sintesi di filtri digitali non ricorsivi, Computing of high breakdown regression estimators without sorting on graphics processing units, A tutorial on column generation and branch-and-price for vehicle routing problems, Optimal cargo allocation on board a plane: A sequential linear programming approach, A partially inexact bundle method for convex semi-infinite minmax problems, Common diagonal Lyapunov function for third order linear switched system, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, Benders' decomposition for the constrained \(\ell_ 1\)-problem, Robustness of systems with uncertainties in the input, Multi-level production scheduling for a class of flexible machining and assembly systems, Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria, Optimum design accounting for the global nonlinear behavior of the model, Mathematical model for cyclic scheduling with work-in-process minimization, Investments in stochastic maximum flow networks, Constrained nonconvex nonsmooth optimization via proximal bundle method, An improved column generation algorithm for minimum sum-of-squares clustering, Convex proximal bundle methods in depth: a unified analysis for inexact oracles, Solving DC programs using the cutting angle method, Robust location transportation problems under uncertain demands, Using central prices in the decomposition of linear programs, On the Behrens-Fisher problem: a globally convergent algorithm and a finite-sample study of the Wald, LR and LM tests, Regularized optimization methods for convex MINLP problems, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, A two-stage stochastic programming model for transportation network protection, Cutting plane algorithms and approximate lower subdifferentiability, Globally convergent cutting plane method for nonconvex nonsmooth minimization, A converging algorithm for a linear exchange model, New filled functions for nonsmooth global optimization, Product differentiation and operations strategy in a capacitated environment, Solving a large scale semi-definite logit model, A one-parameter filled function for nonsmooth global optimization and its application, Discrete solutions to engineering design problems, Bounded lower subdifferentiability optimization techniques: applications, Robust network design in telecommunications under polytope demand uncertainty, Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems, Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes, Two-direction subgradient method for non-differentiable optimization problems, A generalized projection-based scheme for solving convex constrained optimization problems, A comparison of computational strategies for geometric programs, Stochastic programming with multivariate second order stochastic dominance constraints with applications in portfolio optimization, 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, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, Synthesis of cutting and separating planes in a nonsmooth optimization method, A geometric characterization of ``optimality-equivalent relaxations, An inexact bundle variant suited to column generation, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, On the choice of explicit stabilizing terms in column generation, The radar method: An effective line search for piecewise linear concave functions, Chebyshev center based column generation, A cutting plane algorithm for MV portfolio selection model, An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems, Supply chain design under uncertainty using sample average approximation and dual decomposition, A linear programming-based optimization algorithm for solving nonlinear programming problems, On the convergence of a class of outer approximation algorithms for convex programs, Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems, Lower subdifferentiable functions and their minimization by cutting planes, An algorithm for linearly constrained convex nondifferentiable minimization problems, 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, Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Lagrangean relaxation. (With comments and rejoinder)., A hybrid LP/NLP paradigm for global optimization relaxations, 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, Numerical methods to design the reaching phase of output feedback variable structure control, On minimizing the largest eigenvalue of a symmetric matrix, Epigraphical nesting: A unifying theory for the convergence of algorithms, Deletion-by-infeasibility rule for DC-constrained global optimization, Computational efficiency of the simplex embedding method in convex nondifferentiable optimization, 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, Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods, 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, 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, Maximal closure on a graph with resource constraints, A projection cutting plane algorithm for convex programming problems, An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions, A quasi-second-order proximal bundle algorithm, Method of simple-body centroids, On solving generalized convex MINLP problems using supporting hyperplane techniques, Canonical DC programming problem: Outer approximation methods revisited, A cutting plane method from analytic centers for stochastic programming, New variants of bundle methods, Optimizing fuzzy portfolio selection problems by parametric quadratic programming, A method for convex minimization based on translated first-order approximations, Learning layered ranking functions with structured support vector machines, A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem, An exact algorithm for a resource allocation problem in mobile wireless communications, A decomposition algorithm for KYP-SDPs, Inexact solution of NLP subproblems in MINLP, Lift-and-project cuts for convex mixed integer nonlinear programs, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Decomposition techniques with mixed integer programming and heuristics for home healthcare planning, Conservative scales in packing problems, An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming, Methods of embedding-cutting off in problems of mathematical programming, Feature selection and classification for high-dimensional incomplete multimodal data, A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions, Large-scale convex optimization methods for air quality policy assessment., Pasting gauges. I: Shortest paths across a hyperplane, A column generation approach to capacitated \(p\)-median problems, A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem, Large-scale unit commitment under uncertainty: an updated literature survey, A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods, A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems, Extension of Zoutendijk method for solving constrained multiobjective optimization problems, A feasible point method with bundle modification for nonsmooth convex constrained optimization, Two-stage robust optimization approach to elective surgery and downstream capacity planning, Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case, A fast gradient and function sampling method for finite-max functions, An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers, Stochastic programming for off-line adaptive radiotherapy, Uncertain convex programs: randomized solutions and confidence levels, A derivative-free trust-region algorithm for composite nonsmooth optimization, AI-based competition of autonomous vehicle fleets with application to fleet modularity, A polyhedral branch-and-cut approach to global optimization, An effective line search for the subgradient method, Tutorial on risk neutral, distributionally robust and risk averse multistage stochastic programming, On single-source capacitated facility location with cost and fairness objectives, Alternate solution approaches for competitive hub location problems, Stochastic dynamic cutting plane for multistage stochastic convex programs, Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system, Regularized decomposition of large scale block-structured robust optimization problems, Stochastic dynamic programming approach to managing power system uncertainty with distributed storage, Outer approximation for global optimization of mixed-integer quadratic bilevel problems, Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, Cutting angle methods in global optimization, MAP inference via \(\ell_2\)-sphere linear program reformulation, Polynomial programming prevents aircraft (and other) conflicts, Design and implementation of a modular interior-point solver for linear optimization, A benders squared \((B^2)\) framework for infinite-horizon stochastic linear programs, Using an interior point method for the master problem in a decomposition approach, Posynomial geometric programming as a special case of semi-infinite linear programming, Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse, Sparse classification: a scalable discrete optimization perspective, Three-dimensional adhesive contact laws with debonding: A nonconvex energy bundle method, 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, A new restricted memory level bundle method for constrained convex nonsmooth optimization, Stabilized column generation, Worst-case analysis of clique MIPs, On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints, Alternative regularizations for outer-approximation algorithms for convex MINLP, A two-stage cutting-plane method for conditional minimizing function, A note on composite concave quadratic programming, An outer-approximation guided optimization approach for constrained neural network inverse problems, A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix, A convex approach to optimum design of experiments with correlated observations, 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, Quantitative stability analysis for minimax distributionally robust risk optimization, Nonlinear chance-constrained problems with applications to hydro scheduling, Variations and extension of the convex-concave procedure, Recourse problem of the 2-stage robust location transportation problem, A minimization method with approximation of feasible set and epigraph of objective function, Tuning strategy for the proximity parameter in convex minimization, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Optimal design of experiments via linear programming, A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, MINIMIZING MAKESPAN IN A MULTICLASS FLUID NETWORK WITH PARAMETER UNCERTAINTY, Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS, Classification in the multiple instance learning framework via spherical separation, Dynamic bundle methods, Piecewise linear approximations in nonconvex nonsmooth optimization, On optimizing over lift-and-project closures, Mixed integer nonlinear programming tools: an updated practical overview, The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems, Uncontrolled inexact information within bundle methods, A simple method for convex optimization in the oracle model, A bundle-type algorithm for routing in telecommunication data networks, Facility location under service level constraints for heterogeneous customers, Optimizing production capacity and safety stocks in general acyclic supply chains, A multi-step doubly stabilized bundle method for nonsmooth convex optimization, Designing a drone delivery network with automated battery swapping machines, Convex analysis in groups and semigroups: a sampler, On the approximation of unbounded convex sets by polyhedra, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, Two linear approximation algorithms for convex mixed integer nonlinear programming, A simple version of bundle method with linear programming, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, Numerical infinitesimals in a variable metric method for convex nonsmooth optimization, Structured learning of binary codes with column generation for optimizing ranking measures, On conditional cuts for stochastic dual dynamic programming, \(K\)-adaptability in two-stage mixed-integer robust optimization, Outer-product-free sets for polynomial optimization and oracle-based cuts, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, Generating valid linear inequalities for nonlinear programs via sums of squares, On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm, Stochastic global optimization algorithms: a systematic formal approach, An approach to robust network design in telecommunications, A Support Function Based Algorithm for Optimization with Eigenvalue Constraints, A cutting plane method for solving KYP-SDPs, An interior-point Benders based branch-and-cut algorithm for mixed integer programs, A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems, Cost-based filtering for shorter path constraints, Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty, Bi-perspective functions for mixed-integer fractional programs with indicator variables, Interior point stabilization for column generation, Design and Verify: A New Scheme for Generating Cutting-Planes, Formulations and exact algorithms for the vehicle routing problem with time windows, A two step algorithm for solving a large scale semi-definite logit model, Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems, Portfolio optimization with relaxation of stochastic second order dominance constraints via conditional value at risk, Comparison of bundle and classical column generation, Solving a dynamic separation problem using MINLP techniques, An aggregate subgradient method for nonsmooth convex minimization, Lagrangian duality applied to the vehicle routing problem with time windows, A sequential cutting plane algorithm for solving convex NLP problems, Proximal bundle methods for nonsmooth DC programming, Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem, A strongly convergent proximal bundle method for convex minimization in Hilbert spaces, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, Route optimization for multiple searchers, A theoretical and empirical analysis of support vector machine methods for multiple-instance classification, Derivative-free robust optimization by outer approximations, When is rounding allowed in integer nonlinear optimization?, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Comparative study of RPSALG algorithm for convex semi-infinite programming, On polyhedral and second-order cone decompositions of semidefinite optimization problems, A modified quasisecant method for global optimization, Modeling formulation and a new heuristic for the railroad blocking problem, A survey of resource constrained shortest path problems: Exact solution approaches, Using regularization and second order information in outer approximation for convex MINLP, New bounds for truthful scheduling on two unrelated selfish machines, A note on quasi convex programming, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, Approximate cutting plane approaches for exact solutions to robust optimization problems, Convexity and optimization with copulæ structured probabilistic constraints, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, Algorithms for some minimax problems, Numerical computational methods of optimisation in control, Robust and stochastic formulations for ambulance deployment and dispatch, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, A duality theorem and an algorithm for (mixed-) integer nonlinear programming, Cutting plane algorithms and state space constrained linear optimal control problems, On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems, Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints, A SMOOTHING PENALIZED SAMPLE AVERAGE APPROXIMATION METHOD FOR STOCHASTIC PROGRAMS WITH SECOND-ORDER STOCHASTIC DOMINANCE CONSTRAINTS, 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, A Subspace Method for Large-Scale Eigenvalue Optimization, Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems, Large-scale unit commitment under uncertainty, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints, Complexity of stochastic dual dynamic programming, On generalized surrogate duality in mixed-integer nonlinear programming
