Pages that link to "Item:Q5704156"
From MaRDI portal
The following pages link to Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization (Q5704156):
Displaying 22 items.
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q495737) (← links)
- The interior proximal extragradient method for solving equilibrium problems (Q839037) (← links)
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities (Q1016351) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
- An LQP-based two-step method for structured variational inequalities (Q1697893) (← links)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- On global subdifferentials with applications in nonsmooth optimization (Q2052399) (← links)
- Optimization and learning with nonlocal calculus (Q2087411) (← links)
- Convergence of inexact quasisubgradient methods with extrapolation (Q2139278) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- A self-adaptive descent LQP alternating direction method for the structured variational inequalities (Q2219447) (← links)
- Convergence of the exponentiated gradient method with Armijo line search (Q2420800) (← links)
- Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
- Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
- A minimization algorithm for equilibrium problems with polyhedral constraints (Q2810110) (← links)
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
- A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming (Q3465935) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- An introduction to continuous optimization for imaging (Q5740077) (← links)
- Distributed optimization with inexact oracle (Q5878522) (← links)
- Primal-dual \(\varepsilon\)-subgradient method for distributed optimization (Q6076822) (← links)
