A proximal subgradient projection algorithm for linearly constrained strictly convex problems
From MaRDI portal
Recommendations
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Publication:4887667
- Projected gradient methods for linearly constrained problems
- scientific article; zbMATH DE number 11412
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
Cites work
- A Limited Memory Algorithm for Bound Constrained Optimization
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- A polynomial algorithm for minimum quadratic cost flow problems
- A primal-dual algorithm for monotropic programming and its application to network optimization
- A survey of algorithms for convex multicommodity flow problems
- An \epsilon-Relaxation Method for Separable Convex Cost Network Flow Problems
- An implementation of linear and nonlinear multicommodity network flows
- Application of the dual active set algorithm to quadratic network optimization
- Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
- Computational development of a lagrangian dual approach for quadratic networks
- Convex Analysis
- scientific article; zbMATH DE number 1086907 (Why is no real title available?)
- Implementation and test of auction methods for solving generalized network flow problems with separable convex cost
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- Implementing cholesky factorization for interior point methods of linear programming
- Monotone Operators and the Proximal Point Algorithm
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Newton's Method for Large Bound-Constrained Optimization Problems
- Newton-Type Minimization via the Lanczos Method
- On large scale nonlinear network optimization
- On the limited memory BFGS method for large scale optimization
- Parallel alternating direction multiplier decomposition of convex programs
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Some numerical experiments with variable-storage quasi-Newton algorithms
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The partitioned -relaxation algorithm for separable convex network flow problems
Cited in
(4)- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- scientific article; zbMATH DE number 11412 (Why is no real title available?)
Describes a project that uses
Uses Software
This page was built for publication: A proximal subgradient projection algorithm for linearly constrained strictly convex problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5436924)
