Pages that link to "Item:Q304260"

The following pages link to A proximal method for composite minimization (Q304260):

Displaying 35 items.

• Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
• Composite proximal bundle method (Q359623) (← links)
• A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
• Cutting plane oracles to minimize non-smooth non-convex functions (Q618887) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
• An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598) (← links)
• Variable smoothing for weakly convex composite functions (Q2031930) (← links)
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
• Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization (Q2089785) (← links)
• An extension of the proximal point algorithm beyond convexity (Q2114582) (← links)
• Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization (Q2116019) (← links)
• On strongly quasiconvex functions: existence results and proximal point algorithms (Q2116608) (← links)
• Global convergence of model function based Bregman proximal minimization algorithms (Q2154449) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• An adaptive fixed-point proximity algorithm for solving total variation denoising models (Q2293175) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• Non-smooth non-convex Bregman minimization: unification and new algorithms (Q2420780) (← links)
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
• Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
• Robust low transformed multi-rank tensor methods for image alignment (Q2660687) (← links)
• A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem (Q2691902) (← links)
• Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications (Q2810547) (← links)
• Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
• Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
• A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications (Q5026439) (← links)
• Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)
• Newton acceleration on manifolds identified by proximal gradient methods (Q6044974) (← links)
• Harnessing Structure in Composite Nonsmooth Minimization (Q6046827) (← links)
• Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem (Q6141535) (← links)
• Consistent approximations in composite optimization (Q6165588) (← links)
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
• The evaluation complexity of finding high-order minimizers of nonconvex optimization (Q6200212) (← links)