Pages that link to "Item:Q2330660"

The following pages link to Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660):

Displaying 42 items.

• Variable smoothing for weakly convex composite functions (Q2031930) (← links)
• A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems (Q2044494) (← links)
• An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization (Q2062324) (← links)
• A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs (Q2063194) (← 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)
• Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
• Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
• Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints (Q2148118) (← links)
• Accelerated inexact composite gradient methods for nonconvex spectral optimization problems (Q2149955) (← links)
• Global convergence of model function based Bregman proximal minimization algorithms (Q2154449) (← links)
• An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems (Q2181594) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• Variable smoothing for convex optimization problems using stochastic gradients (Q2211742) (← links)
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares (Q2696927) (← 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)
• (Q4999088) (← links)
• Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods (Q5003207) (← links)
• Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
• A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications (Q5026439) (← links)
• Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning (Q5043854) (← links)
• Graphical Convergence of Subgradients in Nonconvex Optimization and Learning (Q5076697) (← links)
• Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
• An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems (Q5147027) (← links)
• An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems (Q5162651) (← links)
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)
• Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs (Q5237309) (← links)
• Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems (Q5863523) (← links)
• High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
• A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods (Q5883316) (← links)
• A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization (Q6066421) (← links)
• Learning with risks based on M-location (Q6097134) (← links)
• Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
• Stochastic Gauss-Newton algorithms for online PCA (Q6111665) (← links)
• Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)
• Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
• Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems (Q6155872) (← links)
• Consistent approximations in composite optimization (Q6165588) (← links)
• Average curvature FISTA for nonconvex smooth composite optimization problems (Q6166656) (← links)
• Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems (Q6171323) (← links)