Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
From MaRDI portal
Publication:2696926
DOI10.1007/s10589-022-00445-0OpenAlexW4301366785MaRDI QIDQ2696926
Publication date: 17 April 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-022-00445-0
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Column generation for extended formulations
- A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs
- Total dual integrality and integer polyhedra
- Column generation algorithms for nonlinear optimization. II: Numerical investigations
- A column generation approach to the heterogeneous fleet vehicle routing problem
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Crew pairing at Air France
- Stabilized column generation
- Global convergence of ADMM in nonconvex nonsmooth optimization
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Decomposition-based inner- and outer-refinement algorithms for global optimization
- Separating doubly nonnegative and completely positive matrices
- Optimal sensitivity based on IPOPT
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Factorization and cutting planes for completely positive matrices by copositive projection
- Comparison of bundle and classical column generation
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- Generalized Benders decomposition
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups
- Decomposition in Conic Optimization with Partially Separable Structure
- The Decomposition Algorithm for Linear Programs
- Surrogate Constraint Duality in Mathematical Programming
- Simplicial decomposition in nonlinear programming algorithms
- On the Shannon capacity of a graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- A column generation algorithm for nonlinear programming
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization
- A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions
- Optimization for L1-Norm Error Fitting via Data Aggregation
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Risk Averse Shortest Paths: A Computational Study
- Structure Detection in Mixed-Integer Programs
- Selected Topics in Column Generation
- Risk Aversion in the Small and in the Large
- An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
- The Convex Simplex Method
- Surrogate Mathematical Programming
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
This page was built for publication: Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes