Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Sequential Linear Programming Algorithm for Solving Monotone Variational Inequalities
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- A unified description of iterative algorithms for traffic equilibria
- An extension of the frank and Wolfe method of feasible directions
- Branch-and-price: Column generation for solving huge integer programs
- Characterization of solution sets of convex programs
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
- Convex Analysis
- Convex programming in Hilbert space
- Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
- Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
- Decomposition Principle for Linear Programs
- Decomposition algorithm for convex differentiable minimization
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Exposing Constraints
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Finiteness in restricted simplicial decomposition
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Minimizing pseudoconvex functions on convex compact sets
- Multicommodity network flows: The impact of formulation on decomposition
- On the Convergence of Sequences of Convex Sets in Finite Dimensions
- On the Identification of Active Constraints
- On the convergence of projected gradient processes to singular critical points
- Partial linearization methods in nonlinear programming
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Restricted simplicial decomposition for convex constrained problems
- Restricted simplicial decomposition: Computation and extensions
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- Simplicial decomposition in nonlinear programming algorithms
- The decomposition principle and algorithms for linear programming
- Variational Analysis
- Weak Sharp Minima in Mathematical Programming
- Weak Sharp Solutions of Variational Inequalities
- `` Direct Search Solution of Numerical and Statistical Problems
Cited in
(17)- scientific article; zbMATH DE number 679864 (Why is no real title available?)
- Linear fractional approximations for master problems in column generation
- A matrix generation approach for eigenvalue optimization
- Distributed algorithms for convex problems with linear coupling constraints
- A column generation algorithm for solving energy system planning problems
- Experiments on Exact Crossing Minimization Using Column Generation
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- On the partial convexification for low-rank spectral optimization: rank bounds and algorithms
- Master problem approximations in Dantzig-Wolfe decomposition of variational inequality problems with applications to two energy market models
- Column generation algorithms for nonlinear optimization. II: Numerical investigations
- A generalization of column generation to accelerate convergence
- Using Column Generation Techniques for Treating Dynamic Multisectoral Models with Price-Dependent Coefficients
- On the choice of explicit stabilizing terms in column generation
- A proximal extension of the column generation method to nonconvex conic optimization providing bounds for the duality gap
- A unified convergence framework for nonmonotone inexact decomposition methods
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- An efficient greedy heuristic for the real-time train platforming problem
This page was built for publication: Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430668)
