Pages that link to "Item:Q1811622"
From MaRDI portal
The following pages link to Mirror descent and nonlinear projected subgradient methods for convex optimization. (Q1811622):
Displaying 50 items.
- Primal-dual subgradient methods for convex problems (Q116219) (← links)
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles (Q263192) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- On the ergodic convergence rates of a first-order primal-dual algorithm (Q312675) (← links)
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- A weighted mirror descent algorithm for nonsmooth convex optimization problem (Q328453) (← links)
- Techniques for gradient-based bilevel optimization with non-smooth lower level problems (Q334266) (← links)
- Generalized mirror descents in congestion games (Q334813) (← links)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- Training effective node classifiers for cascade classification (Q361264) (← links)
- Accelerated training of max-margin Markov networks with kernels (Q391744) (← links)
- An alternating extragradient method with non Euclidean projections for saddle point problems (Q480931) (← links)
- A generalized online mirror descent with applications to classification and regression (Q493737) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Saddle point mirror descent algorithm for the robust PageRank problem (Q505294) (← links)
- A continuous-time approach to online optimization (Q520967) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
- A version of the mirror descent method to solve variational inequalities (Q681901) (← links)
- Bregman proximal gradient algorithms for deep matrix factorization (Q826170) (← links)
- Feature-aware regularization for sparse online learning (Q893629) (← 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)
- Optimal distributed stochastic mirror descent for strongly convex optimization (Q1640744) (← links)
- Algorithms of inertial mirror descent in convex problems of stochastic optimization (Q1641948) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
- A fast dual proximal gradient algorithm for convex minimization and applications (Q1667162) (← links)
- Stochastic mirror descent method for distributed multi-agent optimization (Q1670526) (← links)
- Generalized mirror descents with non-convex potential functions in atomic congestion games: continuous time and discrete time (Q1679909) (← links)
- Iterative regularization via dual diagonal descent (Q1703168) (← links)
- Scale-free online learning (Q1704560) (← links)
- Distributed constrained optimization via continuous-time mirror design (Q1713810) (← links)
- Learning in games with continuous action sets and unknown payoff functions (Q1717237) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- An efficient approach to solve the large-scale semidefinite programming problems (Q1955162) (← links)
- On the convergence time of a natural dynamics for linear programming (Q1986962) (← links)
- Inertial alternating generalized forward-backward splitting for image colorization (Q1999474) (← links)
- Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
- Natural gradient for combined loss using wavelets (Q2027975) (← links)
- A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
- Fastest rates for stochastic mirror descent methods (Q2044496) (← links)
- Infinite-dimensional gradient-based descent for alpha-divergence minimisation (Q2054493) (← links)
- Inverse reinforcement learning in contextual MDPs (Q2071371) (← links)
- Acceptable set topic modeling (Q2077938) (← links)
- Curiosities and counterexamples in smooth convex optimization (Q2089782) (← links)
- A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems (Q2095329) (← links)
- Network manipulation algorithm based on inexact alternating minimization (Q2109010) (← links)
