Pages that link to "Item:Q2425177"

The following pages link to Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177):

Displaying 26 items.

• Nonconvex robust programming via value-function optimization (Q2028490) (← links)
• Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
• A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
• Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs (Q2158841) (← links)
• A double extrapolation primal-dual algorithm for saddle point problems (Q2211739) (← links)
• On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
• A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
• Linear-step solvability of some folded concave and singly-parametric sparse optimization problems (Q2693645) (← links)
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
• Composite Difference-Max Programs for Modern Statistical Estimation Problems (Q4562249) (← links)
• Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse (Q4971014) (← links)
• Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods (Q5210513) (← links)
• Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930) (← links)
• Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization (Q5868947) (← links)
• Penalty and Augmented Lagrangian Methods for Constrained DC Programming (Q5868956) (← links)
• Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm (Q6138297) (← links)
• A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems (Q6141533) (← links)
• Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis (Q6158000) (← links)
• A refined inertial DC algorithm for DC programming (Q6159465) (← links)
• Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization (Q6188511) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
• A proximal alternating direction method of multipliers for DC programming with structured constraints (Q6536834) (← links)
• A generalized formulation for group selection via ADMM (Q6571367) (← links)
• On the rate of convergence of the difference-of-convex algorithm (DCA) (Q6596346) (← links)
• A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)