A proximal subgradient projection algorithm for linearly constrained strictly convex problems
From MaRDI portal
Publication:5436924
DOI10.1080/10556780601079266zbMath1186.90090OpenAlexW1973598047MaRDI QIDQ5436924
Publication date: 18 January 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780601079266
Uses Software
Cites Work
- Unnamed Item
- A polynomial algorithm for minimum quadratic cost flow problems
- On large scale nonlinear network optimization
- Some numerical experiments with variable-storage quasi-Newton algorithms
- On the limited memory BFGS method for large scale optimization
- An implementation of linear and nonlinear multicommodity network flows
- The partitioned \(\varepsilon\)-relaxation algorithm for separable convex network flow problems
- Parallel alternating direction multiplier decomposition of convex programs
- A primal-dual algorithm for monotropic programming and its application to network optimization
- Implementation and test of auction methods for solving generalized network flow problems with separable convex cost
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- Application of the dual active set algorithm to quadratic network optimization
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- Newton-Type Minimization via the Lanczos Method
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Implementing cholesky factorization for interior point methods of linear programming
- Computational development of a lagrangian dual approach for quadratic networks
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Monotone Operators and the Proximal Point Algorithm
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
- Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
- An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
- Newton's Method for Large Bound-Constrained Optimization Problems
- A Limited Memory Algorithm for Bound Constrained Optimization
- Convex Analysis
This page was built for publication: A proximal subgradient projection algorithm for linearly constrained strictly convex problems
