Pages that link to "Item:Q5470216"
From MaRDI portal
The following pages link to Interior Gradient and Proximal Methods for Convex and Conic Optimization (Q5470216):
Displaying 50 items.
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- Gradient sliding for composite optimization (Q312670) (← links)
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q495737) (← links)
- Legendre transform and applications to finite and infinite optimization (Q505632) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454) (← links)
- An interior proximal method in vector optimization (Q635150) (← links)
- The interior proximal extragradient method for solving equilibrium problems (Q839037) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities (Q1016351) (← links)
- Subgradient methods for saddle-point problems (Q1035898) (← links)
- On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization (Q1037353) (← links)
- Inexact multi-objective local search proximal algorithms: application to group dynamic and distributive justice problems (Q1637356) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
- Accelerated schemes for a class of variational inequalities (Q1680963) (← links)
- An inexact proximal method with proximal distances for quasimonotone equilibrium problems (Q1689071) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- An LQP-based two-step method for structured variational inequalities (Q1697893) (← links)
- A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization (Q1734766) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- An optimal randomized incremental gradient method (Q1785198) (← links)
- An alternating direction method for finding Dantzig selectors (Q1927184) (← links)
- Iteration-complexity of first-order penalty methods for convex programming (Q1949272) (← links)
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems (Q2022322) (← links)
- Quartic first-order methods for low-rank minimization (Q2031993) (← links)
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems (Q2089886) (← links)
- Accelerating variance-reduced stochastic gradient methods (Q2118092) (← links)
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization (Q2139254) (← links)
- Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- Algorithms for stochastic optimization with function or expectation constraints (Q2181600) (← links)
- The multiproximal linearization method for convex composite problems (Q2191762) (← links)
- Inexact version of Bregman proximal gradient algorithm (Q2198034) (← links)
- A self-adaptive descent LQP alternating direction method for the structured variational inequalities (Q2219447) (← links)
- Safe feature elimination for non-negativity constrained convex optimization (Q2302836) (← links)
- The modified second APG method for DC optimization problems (Q2311112) (← links)
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
- An interior projected-like subgradient method for mixed variational inequalities (Q2336578) (← links)
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators (Q2340520) (← links)
- Adaptive restart for accelerated gradient schemes (Q2355332) (← links)
