Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
From MaRDI portal
Publication:1388858
DOI10.1016/0377-2217(94)E0355-FzbMath0899.90153OpenAlexW1996981733MaRDI QIDQ1388858
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)e0355-f
Related Items (2)
A fifth bibliography of fractional programming* ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Auxiliary problem principle and decomposition of optimization problems
- An extended descent framework for variational inequalities
- Linearized simplicial decomposition methods for computing traffic equilibria on networks
- An algorithm for nonlinear programs over Cartesian product sets
- A Generalization of the Proximal Point Algorithm
- Network design problem with congestion effects: A case of bilevel programming
- Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the Goldstein-Levitin-Polyak gradient projection method
- Optimization by decomposition and coordination: A unified approach
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
This page was built for publication: Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
