Pages that link to "Item:Q1772961"
From MaRDI portal
The following pages link to The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961):
Displaying 50 items.
- Signal and image approximation with level-set constraints (Q946472) (← links)
- On the subdifferentiability of the difference of two functions and local minimization (Q1005123) (← links)
- Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA (Q1035284) (← links)
- DC programming and DCA for globally solving the value-at-risk (Q1035285) (← links)
- Optimality conditions and duality for DC programming in locally convex spaces (Q1035476) (← links)
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
- Convex analysis approach to d. c. programming: Theory, algorithms and applications (Q1384439) (← links)
- Exact penalty in d. c. programming (Q1573084) (← links)
- Inertial proximal algorithm for difference of two maximal monotone operators (Q1616724) (← links)
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model (Q1642987) (← links)
- A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks (Q1652272) (← links)
- Modeling and computational optimization for complex system management (Q1652416) (← links)
- DC programming and DCA for solving Brugnano-Casulli piecewise linear systems (Q1652418) (← links)
- DC programming and DCA for enhancing physical layer security via cooperative jamming (Q1652424) (← links)
- Homogeneity detection for the high-dimensional generalized linear model (Q1658352) (← links)
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
- Global optimization for optimal power flow over transmission networks (Q1683333) (← links)
- On some geometric conditions for minimality of DCH-functions via DC-duality approach (Q1685589) (← links)
- DC programming algorithm for clusterwise linear \(L_1\) regression (Q1706682) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- D.C. programming approach for solving an applied ore-processing problem (Q1716969) (← links)
- Analysis sparse representation for nonnegative signals based on determinant measure by DC programming (Q1722682) (← links)
- Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802) (← links)
- On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
- A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- DC formulations and algorithms for sparse optimization problems (Q1749449) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- Robust multicategory support vector machines using difference convex algorithm (Q1749454) (← 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)
- Dictionary learning for fast classification based on soft-thresholding (Q1799991) (← links)
- Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- Margin maximization in spherical separation (Q1928756) (← links)
- Value-at-risk optimization using the difference of convex algorithm (Q1929961) (← links)
- A framework for optimization under ambiguity (Q1931627) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization (Q1935888) (← links)
- Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
- A branch-and-bound algorithm embedded with DCA for DC programming (Q1954706) (← links)
