The following pages link to (Q3967358):
Displaying 50 items.
- Geometric median and robust estimation in Banach spaces (Q122792) (← links)
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks (Q301668) (← links)
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← 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)
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
- A weighted mirror descent algorithm for nonsmooth convex optimization problem (Q328453) (← links)
- On the worst case performance of the steepest descent algorithm for quadratic functions (Q344945) (← links)
- Sparse non Gaussian component analysis by semidefinite programming (Q374189) (← links)
- Accelerated training of max-margin Markov networks with kernels (Q391744) (← links)
- Multiobjective \(L_1/H_\infty\) controller design for systems with frequency and time domain constraints (Q397610) (← links)
- Discussion on: ``Multiobjective \(L_1/H_\infty\) controller design for systems with frequency and time domain constraints'' (Q397611) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- A sparsity preserving stochastic gradient methods for sparse regression (Q457215) (← links)
- A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
- On lower complexity bounds for large-scale smooth convex optimization (Q478994) (← links)
- Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement (Q489145) (← links)
- A generalized online mirror descent with applications to classification and regression (Q493737) (← links)
- Conditional gradient algorithms for norm-regularized smooth convex optimization (Q494314) (← links)
- Universal gradient methods for convex optimization problems (Q494332) (← links)
- Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q495737) (← links)
- Saddle point mirror descent algorithm for the robust PageRank problem (Q505294) (← links)
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions (Q507334) (← links)
- The exact information-based complexity of smooth convex minimization (Q511109) (← links)
- An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods (Q511970) (← links)
- Minimizing finite sums with the stochastic average gradient (Q517295) (← links)
- A continuous-time approach to online optimization (Q520967) (← links)
- On the optimality of Krylov information (Q580896) (← links)
- The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
- Inductively inferring valid logical models of continuous-state dynamical systems (Q673881) (← links)
- Near-optimal stochastic approximation for online principal component estimation (Q681490) (← links)
- A two-dimensional bisection envelope algorithm for fixed points (Q700187) (← links)
- Benefit sharing in holding situations (Q707151) (← links)
- A class of ADMM-based algorithms for three-block separable convex programming (Q721954) (← links)
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle (Q727222) (← links)
- An optimal algorithm for global optimization and adaptive covering (Q727397) (← links)
- Make \(\ell_1\) regularization effective in training sparse CNN (Q782914) (← links)
- Marginally parameterized spatio-temporal models and stepwise maximum likelihood estimation (Q830623) (← links)
- Best subset selection, persistence in high-dimensional statistical learning and optimization under \(l_1\) constraint (Q869974) (← links)
- Existence and computation of short-run equilibria in economic geography (Q870122) (← links)
- Global optimization in clustering using hyperbolic cross points (Q877116) (← links)
- Empirical risk minimization for heavy-tailed losses (Q892246) (← links)
- Iterative methods of stochastic approximation for solving non-regular nonlinear operator equations (Q904385) (← links)
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems (Q908377) (← links)
- Lower bounds for randomized direct search with isotropic sampling (Q943792) (← links)
- Learning by mirror averaging (Q955138) (← links)
