Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
DOI10.1080/0233193031000079856zbMath1033.65040OpenAlexW2061234613MaRDI QIDQ4430668
Michael Patriksson, Ricardo García, ángel G. Marín
Publication date: 12 October 2003
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0233193031000079856
algorithmsvariational inequalitiescolumn generationfinite convergencesimplicessimplicial decompositionoptimal facelarge-scale mathematical programming problemsnonlinear network flow problempseudo-convex minimization
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The decomposition principle and algorithms for linear programming
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Finiteness in restricted simplicial decomposition
- Minimizing pseudoconvex functions on convex compact sets
- Decomposition algorithm for convex differentiable minimization
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Partial linearization methods in nonlinear programming
- Multicommodity network flows: The impact of formulation on decomposition
- A unified description of iterative algorithms for traffic equilibria
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
- On the convergence of projected gradient processes to singular critical points
- Restricted simplicial decomposition for convex constrained problems
- Characterization of solution sets of convex programs
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Sequential Linear Programming Algorithm for Solving Monotone Variational Inequalities
- Weak Sharp Minima in Mathematical Programming
- Decomposition Principle for Linear Programs
- Restricted simplicial decomposition: Computation and extensions
- Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
- On the Identification of Active Constraints
- `` Direct Search Solution of Numerical and Statistical Problems
- On the Convergence of Sequences of Convex Sets in Finite Dimensions
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Simplicial decomposition in nonlinear programming algorithms
- Weak Sharp Solutions of Variational Inequalities
- Exposing Constraints
- Variational Analysis
- Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Projected Newton Methods for Optimization Problems with Simple Constraints
- An extension of the frank and Wolfe method of feasible directions
- Convex programming in Hilbert space
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Convex Analysis
This page was built for publication: Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis