Pages that link to "Item:Q4864878"
From MaRDI portal
The following pages link to Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming (Q4864878):
Displayed 23 items.
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
- Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- Augmented Lagrangian applied to convex quadratic problems (Q932544) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- Approximate iterations in Bregman-function-based proximal algorithms (Q1290655) (← links)
- Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- On some properties of generalized proximal point methods for variational inequalities (Q1389080) (← links)
- Some properties of generalized proximal point methods for quadratic and linear programming (Q1896573) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
- Decomposition for structured convex programs with smooth multiplier methods (Q2572336) (← links)
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming (Q2786322) (← links)
- Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
- Rescaled proximal methods for linearly constrained convex problems (Q3515390) (← links)
- A new family of penalties for augmented Lagrangian methods (Q3588894) (← links)
- On a proximal point method for convex optimization in banach spaces (Q4385279) (← links)
- Non-Convex feasibility problems and proximal point methods (Q4673320) (← links)
- Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227) (← links)