Pages that link to "Item:Q128676"

The following pages link to Smooth minimization of non-smooth functions (Q128676):

Displaying 50 items.

• Robust least square semidefinite programming with applications (Q457207) (← links)
• Proximal methods for the latent group lasso penalty (Q457209) (← links)
• A sparsity preserving stochastic gradient methods for sparse regression (Q457215) (← links)
• Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
• An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
• Method of conjugate subgradients with constrained memory (Q463369) (← links)
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
• An alternating extragradient method with non Euclidean projections for saddle point problems (Q480931) (← links)
• Approximation bounds for sparse principal component analysis (Q484129) (← links)
• Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
• A nearly linear-time PTAS for explicit fractional packing and covering linear programs (Q487021) (← links)
• Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement (Q489145) (← links)
• Gradient consistency for integral-convolution smoothing functions (Q491234) (← links)
• Universal gradient methods for convex optimization problems (Q494332) (← links)
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm'' (Q495742) (← links)
• An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
• Simultaneous nonlinear model predictive control and state estimation (Q510104) (← 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)
• Minimizing finite sums with the stochastic average gradient (Q517295) (← links)
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset (Q518124) (← links)
• Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
• An extragradient-based alternating direction method for convex minimization (Q525598) (← links)
• Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem (Q544781) (← links)
• Compressive wave computation (Q544804) (← links)
• Optimization problems in statistical learning: duality and optimality conditions (Q545113) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• Dualization of signal recovery problems (Q618873) (← links)
• An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection (Q621755) (← links)
• Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454) (← links)
• Convex approximations to sparse PCA via Lagrangian duality (Q631218) (← links)
• Testing the nullspace property using semidefinite programming (Q633104) (← links)
• Barrier subgradient method (Q633113) (← links)
• A block coordinate gradient descent method for regularized convex separable optimization and covariance selection (Q644904) (← links)
• Random algorithms for convex minimization problems (Q644912) (← links)
• Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression (Q662292) (← links)
• Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
• Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
• Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
• A convergent overlapping domain decomposition method for total variation minimization (Q711582) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints (Q727234) (← links)
• The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank (Q736033) (← links)
• Fast proximity-gradient algorithms for structured convex optimization problems (Q739473) (← links)
• Matrix-free interior point method for compressed sensing problems (Q744215) (← links)
• Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
• Application of a new accelerated algorithm to regression problems (Q780302) (← links)
• A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics (Q785497) (← links)
• Algorithms and software for total variation image reconstruction via first-order methods (Q849148) (← links)
• Large-scale semidefinite programming via a saddle point mirror-prox algorithm (Q868467) (← links)