Decomposition and Nondifferentiable Optimization with the Projective Algorithm
From MaRDI portal
Publication:4005806
DOI10.1287/mnsc.38.2.284zbMath0762.90050OpenAlexW2064948689MaRDI QIDQ4005806
Jean-Philippe Vial, Jean-Louis Goffin, Alain B. Haurie
Publication date: 27 September 1992
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.38.2.284
Convex programming (90C25) Nonlinear programming (90C30) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Large-scale optimization with the primal-dual column generation method, Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems, Algorithms for multiplayer multicommodity flow problems, Scenario analysis via bundle decomposition, Complexity of some cutting plane methods that use analytic centers, DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS, Improved branching disjunctions for branch-and-bound: an analytic center approach, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem, Solving the \(p\)-median problem with a semi-Lagrangian relaxation, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Recursive central rounding for mixed integer programs, A logarithmic barrier cutting plane method for convex programming, Interior-point methods: An old and new approach to nonlinear programming, A branch-and-price algorithm for the capacitated facility location problem, A matrix generation approach for eigenvalue optimization, An analytic center cutting plane method for pseudomonotone variational inequalities, Solving real-world linear ordering problems using a primal-dual interior point cutting plane method, Implementing the simplex method as a cutting-plane method, with a view to regularization, A cutting plane method from analytic centers for stochastic programming, Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities, Complexity estimates of some cutting plane methods based on the analytic barrier, Time scale decomposition in production planning for unreliable flexible manufacturing systems, An integer optimality condition for column generation on zero-one linear programs, An approach to robust network design in telecommunications, An interior point cutting plane heuristic for mixed integer programming, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, 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, Unnamed Item, Large-scale convex optimization methods for air quality policy assessment., Specialized fast algorithms for IQC feasibility and optimization problems., An improved column generation algorithm for minimum sum-of-squares clustering, Convex proximal bundle methods in depth: a unified analysis for inexact oracles, Column generation bounds for numerical microaggregation, On the complexity of following the central path of linear programs by linear extrapolation. II, A new warmstarting strategy for the primal-dual column generation method, Solving combinatorial optimization problems using Karmarkar's algorithm, Using central prices in the decomposition of linear programs, Comparison of bundle and classical column generation, On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm, New filled functions for nonsmooth global optimization, A one-parameter filled function for nonsmooth global optimization and its application, Nodal aggregation of resource constraints in a shortest path problem, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, An oracle based method to compute a coupled equilibrium in a model of international climate policy, The omnipresence of Lagrange, J-MEANS: A new local search heuristic for minimum sum of squares clustering, An improved Lagrangian relaxation and dual ascent approach to facility location problems, An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming†, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, Essentials of numerical nonsmooth optimization, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension, Using an interior point method for the master problem in a decomposition approach, Warm start of the primal-dual method applied in the cutting-plane scheme, Solving an equilibrium model for trade of \(\text{CO}_2\) emission permits, Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Robust min-max portfolio strategies for rival forecast and risk scenarios, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, Interior-point methods with decomposition for solving large-scale linear programs, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Essentials of numerical nonsmooth optimization, Homogeneous analytic center cutting plane methods with approximate centers, A doubly stabilized bundle method for nonsmooth convex optimization
Uses Software
