Pages that link to "Item:Q5758227"
From MaRDI portal
The following pages link to Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227):
Displaying 15 items.
- On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization (Q1037353) (← links)
- Implementing proximal point methods for linear programming (Q1123124) (← links)
- Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← links)
- Linear convergence rate for the MDM algorithm for the nearest point problem (Q1678696) (← links)
- Primal and dual convergence of a proximal point exponential penalty method for linear programming (Q1849261) (← links)
- Some properties of generalized proximal point methods for quadratic and linear programming (Q1896573) (← links)
- A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292) (← links)
- On dual convergence of the generalized proximal point method with Bregman distances (Q2757655) (← links)
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming (Q2786322) (← links)
- Generalized proximal distances for bilevel equilibrium problems (Q2796800) (← links)
- A generalized like-distance in convex programming (Q3505820) (← links)
- Re-examination of Bregman functions and new properties of their divergences (Q4613995) (← links)
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming (Q4864878) (← links)
- On the linear convergence of a Bregman proximal point algorithm (Q5088831) (← links)
- Excessive Gap Technique in Nonsmooth Convex Minimization (Q5317557) (← links)
