Pages that link to "Item:Q5219676"

The following pages link to Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676):

Displaying 50 items.

• A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications (Q4960078) (← links)
• On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent (Q4969070) (← links)
• MultiLevel Composite Stochastic Optimization via Nested Variance Reduction (Q4987278) (← links)
• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
• Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions (Q4991666) (← 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)
• Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds (Q5070619) (← links)
• Stochastic Multilevel Composition Optimization Algorithms with Level-Independent Convergence Rates (Q5072589) (← links)
• On the Convergence of Stochastic Primal-Dual Hybrid Gradient (Q5081780) (← links)
• Golden Ratio Primal-Dual Algorithm with Linesearch (Q5093645) (← links)
• Trimmed Statistical Estimation via Variance Reduction (Q5108267) (← links)
• Thresholding gradient methods in Hilbert spaces: support identification and linear convergence (Q5109200) (← links)
• Sample Complexity of Sample Average Approximation for Conditional Stochastic Optimization (Q5116551) (← links)
• New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization (Q5162590) (← links)
• On the Simplicity and Conditioning of Low Rank Semidefinite Programs (Q5162653) (← links)
• An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
• Sharpness, Restart, and Acceleration (Q5210521) (← links)
• Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity (Q5231668) (← links)
• Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems (Q5231692) (← links)
• Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity (Q5233106) (← links)
• No Gap Second-Order Optimality Conditions for Circular Conic Programs (Q5379295) (← links)
• Quadratic Growth and Strong Metric Subregularity of the Subdifferential via Subgradient Graphical Derivative (Q5853563) (← links)
• Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction (Q5860374) (← links)
• On Degenerate Doubly Nonnegative Projection Problems (Q5868954) (← links)
• High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
• Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
• Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization (Q5870366) (← links)
• A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods (Q5883316) (← links)
• Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity (Q6038639) (← links)
• A diagonal finite element-projection-proximal gradient algorithm for elliptic optimal control problem (Q6048981) (← links)
• Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
• Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)
• A strict complementarity approach to error bound and sensitivity of solution of conic programs (Q6164955) (← links)
• Consistent approximations in composite optimization (Q6165588) (← links)
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
• Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization (Q6166657) (← links)
• Calculus rules of the generalized concave Kurdyka-Łojasiewicz property (Q6167075) (← links)
• Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient (Q6168888) (← links)
• Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy (Q6176299) (← links)
• Convergence Rate Analysis of a Dykstra-Type Projection Algorithm (Q6202756) (← links)
• On Local Error Bound in Nonlinear Programs (Q6488343) (← links)
• A semismooth Newton stochastic proximal point algorithm with variance reduction (Q6490309) (← links)
• The level-set subdifferential error bound via Moreau envelopes (Q6561484) (← links)
• Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm (Q6564758) (← links)
• A Levenberg-Marquardt method for nonsmooth regularized least squares (Q6590132) (← links)
• Complementary composite minimization, small gradients in general norms, and applications (Q6634528) (← links)
• Variance reduction techniques for stochastic proximal point algorithms (Q6644264) (← links)
• Kurdyka-Łojasiewicz exponent via Hadamard parametrization (Q6663111) (← links)
• Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)