Pages that link to "Item:Q2125070"
From MaRDI portal
The following pages link to An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070):
Displaying 10 items.
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
- Sequential difference-of-convex programming (Q2198538) (← links)
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
- A subgradient-based convex approximations method for DC programming and its applications (Q2358301) (← links)
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176) (← links)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
- Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming (Q5869814) (← links)
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems (Q6141533) (← links)
- Inexact proximal DC Newton-type method for nonconvex composite functions (Q6155059) (← links)
- Global convergence and acceleration of projection methods for feasibility problems involving union convex sets (Q6667563) (← links)
