Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
From MaRDI portal
Recommendations
- A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space
- Pseudomonotone variational inequalities: convergence of the auxiliary problem method
- scientific article; zbMATH DE number 1086739
- Auxiliary problem principle extended to variational inequalities
Cites work
- scientific article; zbMATH DE number 3597791 (Why is no real title available?)
- scientific article; zbMATH DE number 3284930 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Generalization of the Proximal Point Algorithm
- An algorithm for nonlinear programs over Cartesian product sets
- An extended descent framework for variational inequalities
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Auxiliary problem principle and decomposition of optimization problems
- Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
- Linearized simplicial decomposition methods for computing traffic equilibria on networks
- Network design problem with congestion effects: A case of bilevel programming
- 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
Cited in
(3)
This page was built for publication: Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388858)
