The following pages link to DC programming: overview. (Q1969457):
Displaying 50 items.
- D.C. programming approach for solving an applied ore-processing problem (Q1716969) (← links)
- A note on optimality conditions for DC programs involving composite functions (Q1722334) (← links)
- On modeling and global solutions for d.c. optimization problems by canonical duality theory (Q1734755) (← links)
- On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions (Q1743534) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- Continuous relaxation for discrete DC programming (Q1749451) (← links)
- A general nonconvex multiduality principle (Q1752635) (← links)
- A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
- The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- A framework for optimization under ambiguity (Q1931627) (← links)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
- Assessing robustness of classification using an angular breakdown point (Q1990584) (← links)
- Locating a semi-obnoxious facility in the special case of Manhattan distances (Q2009180) (← links)
- Data-driven distributionally robust capacitated facility location problem (Q2030664) (← links)
- Multiple-source adaptation theory and algorithms (Q2035631) (← links)
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification (Q2105868) (← links)
- Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach (Q2106765) (← links)
- A unified Douglas-Rachford algorithm for generalized DC programming (Q2114583) (← links)
- A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems (Q2143100) (← links)
- The DTC (difference of tangentially convex functions) programming: optimality conditions (Q2146366) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- Sparse signal recovery via generalized Gaussian function (Q2154451) (← links)
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
- A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations (Q2163076) (← links)
- Oscillations in mixed-feedback systems (Q2169789) (← links)
- Clusterwise support vector linear regression (Q2189912) (← links)
- Large-scale regression with non-convex loss and penalty (Q2192647) (← links)
- Solving polyhedral d.c. optimization problems via concave minimization (Q2200081) (← links)
- Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation (Q2205979) (← links)
- An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
- A class of semi-supervised support vector machines by DC programming (Q2256780) (← links)
- Lagrange duality in canonical DC programming (Q2258474) (← links)
- Sensorless supervision of linear dynamical systems: the feed-forward command governor approach (Q2276097) (← links)
- On convexification of system identification criteria (Q2289048) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
- A difference of convex optimization algorithm for piecewise linear regression (Q2313774) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781) (← links)
- A non-convex algorithm framework based on DC programming and DCA for matrix completion (Q2340366) (← links)
- (\(\epsilon\)-)efficiency in difference vector optimization (Q2342955) (← links)
- A tight analysis of the submodular-supermodular procedure (Q2345618) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- A subgradient-based convex approximations method for DC programming and its applications (Q2358301) (← links)
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration (Q2359752) (← links)
