Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
From MaRDI portal
Publication:1319860
DOI10.1007/BF02142674zbMath0789.65045MaRDI QIDQ1319860
J. C. Dodu, T. Eve, Michel Minoux
Publication date: 13 June 1994
Published in: Numerical Algorithms (Search for Journal in Brave)
computational experimentstransportation problemslinear constraintstest problemsimplementationproximal point algorithmconvex linearly constrained nonsmooth optimization
Related Items
Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard, Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- An aggregate subgradient method for nonsmooth convex minimization
- The Cutting-Plane Method for Solving Convex Programs
- A descent algorithm for nonsmooth convex optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Numerical methods for nondifferentiable convex optimization
- Proximité et dualité dans un espace hilbertien
