Pages that link to "Item:Q304258"
From MaRDI portal
The following pages link to A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258):
Displayed 18 items.
- An improved algorithm for the \(L_2-L_p\) minimization problem (Q1683685) (← links)
- A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery (Q1687319) (← links)
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation (Q2220667) (← links)
- On constrained optimization with nonconvex regularization (Q2225521) (← links)
- A gradient descent based algorithm for \(\ell_p\) minimization (Q2286916) (← links)
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
- Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs (Q2413100) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming (Q2957850) (← links)
- A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization (Q3174787) (← links)
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
- Sparse Solutions by a Quadratically Constrained ℓq (0 <<i>q</i>< 1) Minimization Model (Q4995085) (← links)
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization (Q5210511) (← links)
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability (Q6161546) (← links)
- An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems (Q6164017) (← links)
