Pages that link to "Item:Q4005806"
From MaRDI portal
The following pages link to Decomposition and Nondifferentiable Optimization with the Projective Algorithm (Q4005806):
Displaying 21 items.
- An integer optimality condition for column generation on zero-one linear programs (Q2419361) (← links)
- A cutting plane method for solving KYP-SDPs (Q2440612) (← links)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems (Q2442700) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- Nodal aggregation of resource constraints in a shortest path problem (Q2490165) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis (Q4430668) (← links)
- Homogeneous analytic center cutting plane methods with approximate centers (Q4504783) (← links)
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS (Q4548051) (← links)
- An extended projective formula and its application to semidefinite optimization (Q4902856) (← links)
- (Q5020878) (← links)
- A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm (Q5202502) (← links)
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming† (Q5449022) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- The omnipresence of Lagrange (Q5920487) (← links)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
- J-MEANS: A new local search heuristic for minimum sum of squares clustering (Q5957595) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)