Pages that link to "Item:Q4698101"
From MaRDI portal
The following pages link to Entropy-Like Proximal Methods in Convex Programming (Q4698101):
Displaying 14 items.
- A new family of penalties for augmented Lagrangian methods (Q3588894) (← links)
- Penalty/Barrier multiplier algorthm for semidefinit programming<sup>∗</sup> (Q4514285) (← links)
- Strict convex regularizations, proximal points and augmented lagrangians (Q4528235) (← links)
- Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming (Q4562766) (← links)
- Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure (Q5013580) (← links)
- A proximal gradient splitting method for solving convex vector optimization problems (Q5034925) (← links)
- A steepest descent-like method for vector optimization problems with variable domination structure (Q5052577) (← links)
- On the linear convergence of a Bregman proximal point algorithm (Q5088831) (← links)
- Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
- A parallel subgradient method extended to variational inequalities involving nonexpansive mappings (Q5140811) (← links)
- Dual convergence of the proximal point method with Bregman distances for linear programming (Q5758227) (← links)
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm (Q6160427) (← links)
- High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods (Q6634529) (← links)
- Bregman distance regularization for nonsmooth and nonconvex optimization (Q6634712) (← links)
