Pages that link to "Item:Q2425176"
From MaRDI portal
The following pages link to A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176):
Displaying 18 items.
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods (Q2052389) (← links)
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
- Alternating DC algorithm for partial DC programming problems (Q2124808) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- Non-convex split Feasibility problems: models, algorithms and theory (Q2165583) (← links)
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection (Q2200085) (← links)
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
- (Q4999088) (← links)
- Sparsity constrained optimization problems via disjunctive programming (Q5039398) (← links)
- A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints (Q5146698) (← links)
- Sparse Solutions of a Class of Constrained Optimization Problems (Q5868942) (← 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)
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems (Q6157998) (← links)
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)