Primal and dual convergence of a proximal point exponential penalty method for linear programming
From MaRDI portal
(Redirected from Publication:1849261)
Recommendations
- Dual convergence of the proximal point method with Bregman distances for linear programming
- Implementing proximal point methods for linear programming
- Dual convergence for penalty algorithms in convex programming
- Quadratic rate of convergence for a primal-dual exponential penalty algorithm
- On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization
Cited in
(13)- Vector exponential penalty function method for nondifferentiable multiobjective programming problems
- Dual convergence for penalty algorithms in convex programming
- Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
- Asymptotic expansion of penalty-gradient flows in linear programming
- Subdivision scheme tuning around extraordinary vertices
- Alternating proximal algorithms with asymptotically vanishing coupling. Application to domain decomposition for PDE's
- Dual convergence of the proximal point method with Bregman distances for linear programming
- An entire space polynomial-time algorithm for linear programming
- An exterior point polynomial-time algorithm for convex quadratic programming
- Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
- A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality
- Iterative regularization via dual diagonal descent
- Coupling the gradient method with a general exterior penalization scheme for convex minimization
This page was built for publication: Primal and dual convergence of a proximal point exponential penalty method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849261)
