Pages that link to "Item:Q3705231"

The following pages link to Descent methods for composite nondifferentiable optimization problems (Q3705231):

Displaying 50 items.

• A proximal method for composite minimization (Q304260) (← links)
• Optimality conditions for a class of composite multiobjective nonsmooth optimization problems (Q377729) (← links)
• Gauss-Newton method for convex composite optimizations on Riemannian manifolds (Q452337) (← links)
• Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems (Q663722) (← links)
• Convex composite multi-objective nonsmooth programming (Q687035) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• A nonlinear descent method for a variational inequality on a nonconvex set (Q735924) (← links)
• Global convergence of a semi-infinite optimization method (Q912572) (← links)
• A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• An algorithm for composite nonsmooth optimization problems (Q1057188) (← links)
• A trust region algorithm for minimization of locally Lipschitzian functions (Q1338134) (← links)
• A relative weighting method for estimating parameters and variances in multiple data sets (Q1350410) (← links)
• Iteration functions in some nonsmooth optimization algorithms (Q1363553) (← links)
• Generalized Kalman smoothing: modeling and algorithms (Q1678609) (← links)
• The value function approach to convergence analysis in composite optimization (Q1709968) (← links)
• A robust sequential quadratic programming method (Q1825141) (← links)
• Epigraphical nesting: A unifying theory for the convergence of algorithms (Q1893312) (← links)
• A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
• Unification of basic and composite nondifferentiable optimization (Q1924063) (← links)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← 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)
• Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
• A joint estimation approach to sparse additive ordinary differential equations (Q2172119) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
• Offline state estimation for hybrid systems via nonsmooth variable projection (Q2307561) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• Recent advances in trust region algorithms (Q2349124) (← 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)
• An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← 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)
• (Q3688115) (← links)
• Second order necessary and sufficient conditions for convex composite NDO (Q3782317) (← links)
• (Q4356861) (← links)
• Stochastic Methods for Composite and Weakly Convex Optimization Problems (Q4561227) (← links)
• Stochastic Model-Based Minimization of Weakly Convex Functions (Q4620418) (← links)
• (Q4988121) (← links)
• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← 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)
• Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems (Q5231692) (← links)
• Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity (Q5233106) (← links)
• Manifold Sampling for $\ell_1$ Nonconvex Optimization (Q5506685) (← links)
• High-Order Optimization Methods for Fully Composite Problems (Q5869820) (← links)
• Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem (Q6141535) (← links)
• Consistent approximations in composite optimization (Q6165588) (← links)
• Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications (Q6197115) (← links)