Decomposition and Nondifferentiable Optimization with the Projective Algorithm
From MaRDI portal
Recommendations
Cited in
(73)- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Solving combinatorial optimization problems using Karmarkar's algorithm
- 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
- Interior-point methods with decomposition for solving large-scale linear programs
- Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
- Complexity of some cutting plane methods that use analytic centers
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Interior-point methods: An old and new approach to nonlinear programming
- An analytic center cutting plane method for pseudomonotone variational inequalities
- Time scale decomposition in production planning for unreliable flexible manufacturing systems
- Large-scale convex optimization methods for air quality policy assessment.
- Specialized fast algorithms for IQC feasibility and optimization problems.
- 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
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- A generalized projective reconstruction theorem and depth constraints for projective factorization
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- Scenario analysis via bundle decomposition
- A logarithmic barrier cutting plane method for convex programming
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- 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
- An oracle based method to compute a coupled equilibrium in a model of international climate policy
- An integer optimality condition for column generation on zero-one linear programs
- 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
- Comparison of bundle and classical column generation
- Nodal aggregation of resource constraints in a shortest path problem
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- A doubly stabilized bundle method for nonsmooth convex optimization
- Large-scale optimization with the primal-dual column generation method
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- Algorithms for multiplayer multicommodity flow problems
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- Recursive central rounding for mixed integer programs
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- An approach to robust network design in telecommunications
- scientific article; zbMATH DE number 3908186 (Why is no real title available?)
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Homogeneous analytic center cutting plane methods with approximate centers
- scientific article; zbMATH DE number 1513156 (Why is no real title available?)
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Column generation bounds for numerical microaggregation
- An extended projective formula and its application to semidefinite optimization
- A new warmstarting strategy for the primal-dual column generation method
- Multicommodity network flows: A survey. II: Solution methods
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming†
- A one-parameter filled function for nonsmooth global optimization and its application
- Essentials of numerical nonsmooth optimization
- The omnipresence of Lagrange
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- Essentials of numerical nonsmooth optimization
- An interior point cutting plane heuristic for mixed integer programming
- An improved column generation algorithm for minimum sum-of-squares clustering
- Using central prices in the decomposition of linear programs
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
- Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
- Solving the p-median problem with a semi-Lagrangian relaxation
- A branch-and-price algorithm for the capacitated facility location problem
- A matrix generation approach for eigenvalue optimization
- New filled functions for nonsmooth global optimization
This page was built for publication: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4005806)
