Pages that link to "Item:Q128676"

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

Displaying 50 items.

• A reduced proximal-point homotopy method for large-scale non-convex BQP (Q2114822) (← links)
• On the computational efficiency of catalyst accelerated coordinate descent (Q2117631) (← links)
• A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm (Q2128772) (← links)
• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss (Q2129205) (← links)
• Oracle complexity separation in convex optimization (Q2139268) (← links)
• Convergence of inexact quasisubgradient methods with extrapolation (Q2139278) (← links)
• Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
• An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization (Q2142534) (← links)
• An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems (Q2146447) (← links)
• Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
• An \(O(s^r)\)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems (Q2149577) (← links)
• Soft clustering by convex electoral model (Q2156895) (← links)
• Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems (Q2156917) (← links)
• Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization (Q2162532) (← links)
• Finding geodesics joining given points (Q2165015) (← links)
• Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model (Q2165892) (← links)
• A hybrid quasi-Newton method with application in sparse recovery (Q2167383) (← links)
• Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions (Q2171123) (← links)
• Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem (Q2176283) (← links)
• An \(\ell_1\)-penalized adaptive normalized quasi-Newton algorithm for sparsity-aware generalized eigen-subspace tracking (Q2181395) (← links)
• Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
• Joint ranking SVM and binary relevance with robust low-rank learning for multi-label classification (Q2185679) (← links)
• Social welfare and profit maximization from revealed preferences (Q2190403) (← links)
• A relaxed Newton-Picard like method for Huber variant of total variation based image restoration (Q2204064) (← links)
• Variable smoothing for convex optimization problems using stochastic gradients (Q2211742) (← links)
• Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653) (← links)
• An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
• Numerical computations of split Bregman method for fourth order total variation flow (Q2223199) (← links)
• Implementable tensor methods in unconstrained convex optimization (Q2227532) (← links)
• A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming (Q2230935) (← links)
• Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization (Q2232754) (← links)
• Approximating the total variation with finite differences or finite elements (Q2235783) (← links)
• Accelerated gradient sliding for minimizing a sum of functions (Q2243755) (← links)
• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing (Q2243965) (← links)
• Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• Homogeneous penalizers and constraints in convex image restoration (Q2251195) (← links)
• Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization (Q2251293) (← links)
• Regret bounded by gradual variation for online convex optimization (Q2251474) (← links)
• A minmax regret linear regression model under uncertainty in the dependent variable (Q2251555) (← links)
• Weiszfeld's method: old and new results (Q2260646) (← links)
• Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
• A numerical exploration of compressed sampling recovery (Q2267399) (← links)
• Alternating direction method for covariance selection models (Q2276406) (← links)
• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
• Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820) (← links)
• On the properties of the method of minimization for convex functions with relaxation on the distance to extremum (Q2287166) (← links)
• Unsupervised meta-path selection for text similarity measure based on heterogeneous information networks (Q2287719) (← links)
• Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
• Primal-dual splitting method for high-order model with application to image restoration (Q2289187) (← links)