Pages that link to "Item:Q1417731"

The following pages link to Introductory lectures on convex optimization. A basic course. (Q1417731):

Displaying 50 items.

• Robust least square semidefinite programming with applications (Q457207) (← links)
• A sparsity preserving stochastic gradient methods for sparse regression (Q457215) (← links)
• On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
• Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) (← links)
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
• A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
• Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721) (← links)
• Convexity of the cost functional in an optimal control problem for a class of positive switched systems (Q463910) (← links)
• Optimum design accounting for the global nonlinear behavior of the model (Q464189) (← links)
• On lower complexity bounds for large-scale smooth convex optimization (Q478994) (← links)
• qpOASES: a parametric active-set algorithm for~quadratic programming (Q482109) (← links)
• Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875) (← links)
• Least quantile regression via modern optimization (Q482902) (← links)
• Greedy expansions in convex optimization (Q483395) (← links)
• Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
• Nearest stable system using successive convex approximations (Q490545) (← links)
• Universal gradient methods for convex optimization problems (Q494332) (← links)
• On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm'' (Q495742) (← links)
• A note on augmented Lagrangian-based parallel splitting method (Q497450) (← links)
• A parallel quadratic programming method for dynamic optimization problems (Q499159) (← links)
• Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality (Q504812) (← links)
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
• The exact information-based complexity of smooth convex minimization (Q511109) (← links)
• On the convergence analysis of the optimized gradient method (Q511969) (← links)
• An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods (Q511970) (← links)
• Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
• A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization (Q517288) (← links)
• Minimizing finite sums with the stochastic average gradient (Q517295) (← links)
• Stability and performance verification of optimization-based controllers (Q518285) (← links)
• A survey on learning approaches for undirected graphical models. Application to scene object recognition (Q518649) (← links)
• Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization (Q519779) (← links)
• Dictionary descent in optimization (Q519963) (← links)
• Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
• The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth (Q523179) (← links)
• Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
• Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
• Image restoration using total variation with overlapping group sparsity (Q527150) (← links)
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• Existence, uniqueness, and convergence of the regularized primal-dual central path (Q613327) (← links)
• The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
• Analysis of stochastic dual dynamic programming method (Q617520) (← links)
• On a global complexity bound of the Levenberg-marquardt method (Q620432) (← links)
• Phase transitions for greedy sparse approximation algorithms (Q629259) (← links)
• Testing the nullspace property using semidefinite programming (Q633104) (← links)
• Barrier subgradient method (Q633113) (← links)