Pages that link to "Item:Q2806813"

The following pages link to Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs (Q2806813):

Displaying 17 items.

• Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• The value function approach to convergence analysis in composite optimization (Q1709968) (← links)
• A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
• SABRINA: a stochastic subspace majorization-minimization algorithm (Q2095568) (← links)
• The proximity operator of the log-sum penalty (Q2103448) (← links)
• An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
• Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
• Convergence analysis of a proximal point algorithm for minimizing differences of functions (Q2977635) (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
• Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence (Q5219695) (← links)
• Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs (Q5868963) (← links)
• Harnessing Structure in Composite Nonsmooth Minimization (Q6046827) (← links)
• Doubly iteratively reweighted algorithm for constrained compressed sensing models (Q6097766) (← links)