Pages that link to "Item:Q427389"

The following pages link to Exact penalty and error bounds in DC programming (Q427389):

Displaying 45 items.

• DC approximation approaches for sparse optimization (Q319281) (← links)
• DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
• Error bounds via exact penalization with applications to concave and quadratic systems (Q727233) (← links)
• Sufficient conditions for error bounds of difference functions and applications (Q727390) (← links)
• Error bounds for the difference of two convex multifunctions (Q742196) (← links)
• Higher-order error bound for the difference of two functions (Q824844) (← links)
• DC programming techniques for solving a class of nonlinear bilevel programs (Q839322) (← links)
• Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
• A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks (Q1652272) (← links)
• A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
• DC programming and DCA: thirty years of developments (Q1749443) (← links)
• DC formulations and algorithms for sparse optimization problems (Q1749449) (← links)
• Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
• Equivalent Lipschitz surrogates for zero-norm and rank optimization problems (Q1756795) (← links)
• A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
• Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates (Q2128773) (← links)
• An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
• Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation (Q2163851) (← links)
• Some brief observations in minimizing the sum of locally Lipschitzian functions (Q2174893) (← links)
• A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model (Q2230777) (← links)
• An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
• Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
• An inertial algorithm for DC programming (Q2281267) (← links)
• New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• Nonlinear error bounds for quasiconvex inequality systems (Q2361132) (← links)
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
• Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates (Q2413090) (← links)
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems (Q2416961) (← links)
• Solving the index tracking problem: a continuous optimization approach (Q2673302) (← links)
• DC Programming and DCA Approach for Resource Allocation Optimization in OFDMA/TDD Wireless Networks (Q2808070) (← links)
• Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
• DC Programming and DCA for General DC Programs (Q3192952) (← links)
• A DC Programming Approach for Sparse Linear Discriminant Analysis (Q3192955) (← links)
• Learning Markov Models Via Low-Rank Optimization (Q5106374) (← links)
• Block Clustering Based on Difference of Convex Functions (DC) Programming and DC Algorithms (Q5378276) (← links)
• Sparse Covariance Matrix Estimation by DCA-Based Algorithms (Q5380866) (← links)
• Sparse Solutions of a Class of Constrained Optimization Problems (Q5868942) (← links)
• Quasi-error bounds for \(p\)-convex set-valued mappings (Q6051185) (← links)
• Nonlocal error bounds for piecewise affine functions (Q6080421) (← links)
• A refined inertial DC algorithm for DC programming (Q6159465) (← links)
• On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
• A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems (Q6173956) (← links)
• Minimizing sequences in a constrained DC optimization problem (Q6194921) (← links)
• Open issues and recent advances in DC programming and DCA (Q6200375) (← links)