Pages that link to "Item:Q1417731"
From MaRDI portal
The following pages link to Introductory lectures on convex optimization. A basic course. (Q1417731):
Displayed 50 items.
- Robust boosting with truncated loss functions (Q82723) (← links)
- Primal-dual subgradient methods for convex problems (Q116219) (← links)
- Analysis of a nonsmooth optimization approach to robust estimation (Q254560) (← links)
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
- Parallel coordinate descent methods for big data optimization (Q263212) (← links)
- An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
- Best subset selection via a modern optimization lens (Q282479) (← links)
- Convex optimization on Banach spaces (Q285434) (← links)
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions (Q285919) (← links)
- Lower bounds on individual sequence regret (Q285930) (← links)
- On data preconditioning for regularized loss minimization (Q285940) (← links)
- Stopping rules for optimization algorithms based on stochastic approximation (Q289128) (← links)
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces (Q300769) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- On estimation of the diagonal elements of a sparse precision matrix (Q302437) (← links)
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- Duality for mixed-integer convex minimization (Q304264) (← links)
- Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
- Optimized first-order methods for smooth convex minimization (Q312663) (← links)
- Gradient sliding for composite optimization (Q312670) (← links)
- On the ergodic convergence rates of a first-order primal-dual algorithm (Q312675) (← links)
- Convergence rates with inexact non-expansive operators (Q312687) (← links)
- A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690) (← links)
- Necessary and sufficient Karush-Kuhn-Tucker conditions for multiobjective Markov chains optimality (Q313188) (← links)
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- Fast convex optimization via inertial dynamics with Hessian driven damping (Q324582) (← links)
- Generalized mirror descents in congestion games (Q334813) (← links)
- Robust reduced-rank modeling via rank regression (Q338394) (← links)
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
- Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963) (← links)
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems (Q346822) (← links)
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
- Gradient methods for minimizing composite functions (Q359630) (← links)
- Techniques for exploring the suboptimal set (Q374684) (← links)
- Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- Fast first-order methods for composite convex optimization with backtracking (Q404292) (← links)
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem (Q415364) (← links)
- Approximate level method for nonsmooth convex minimization (Q415377) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← links)
- Implementation of an optimal first-order method for strongly convex total variation regularization (Q438730) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- About the Lipschitz property of the metric projection in the Hilbert space (Q442476) (← links)
