Pages that link to "Item:Q1749449"

The following pages link to DC formulations and algorithms for sparse optimization problems (Q1749449):

Displaying 50 items.

• Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
• On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
• A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
• Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach (Q1787322) (← links)
• A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem (Q2036185) (← links)
• Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations (Q2052409) (← links)
• The proximal methods for solving absolute value equation (Q2061369) (← links)
• A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
• Data clustering based on the modified relaxation Cheeger cut model (Q2115038) (← links)
• An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
• An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
• The use of grossone in elastic net regularization and sparse support vector machines (Q2156901) (← links)
• A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
• On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression (Q2230800) (← links)
• Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
• A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744) (← links)
• The modified second APG method for DC optimization problems (Q2311112) (← links)
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection (Q2419541) (← links)
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176) (← links)
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
• A proximal algorithm with backtracked extrapolation for a class of structured fractional programming (Q2667040) (← links)
• A global exact penalty for rank-constrained optimization problem and applications (Q2696914) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
• Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity (Q2697002) (← links)
• Polytopal balls arising in optimization (Q3391332) (← links)
• A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization (Q5005209) (← links)
• First-Order Algorithms for a Class of Fractional Optimization Problems (Q5026841) (← links)
• The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems (Q5077161) (← links)
• Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems (Q5093646) (← links)
• Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach (Q5094918) (← links)
• Generalized Subdifferentials of Spectral Functions over Euclidean Jordan Algebras (Q5148401) (← links)
• The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty (Q5162621) (← links)
• Convergence guarantees for a class of non-convex and non-smooth optimization problems (Q5214248) (← links)
• Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming (Q5242930) (← links)
• Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity (Q5348469) (← links)
• Exact penalization for cardinality and rank-constrained optimization problems via partial regularization (Q5882242) (← links)
• Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
• (Q6098205) (← 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)
• Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
• Inexact proximal DC Newton-type method for nonconvex composite functions (Q6155059) (← links)
• A three-operator splitting algorithm with deviations for generalized DC programming (Q6169253) (← links)
• A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
• Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy (Q6176299) (← links)
• An \(\ell_{2,0}\)-norm constrained matrix optimization via extended discrete first-order algorithms (Q6187383) (← links)
• Hybrid Algorithms for Finding a D-Stationary Point of a Class of Structured Nonsmooth DC Minimization (Q6188511) (← links)
• A proximal alternating direction method of multipliers for DC programming with structured constraints (Q6536834) (← links)
• A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)