Pages that link to "Item:Q1384439"
From MaRDI portal
The following pages link to Convex analysis approach to d. c. programming: Theory, algorithms and applications (Q1384439):
Displaying 50 items.
- Robust boosting with truncated loss functions (Q82723) (← links)
- DCA based algorithms for multiple sequence alignment (MSA) (Q301241) (← links)
- DC approximation approaches for sparse optimization (Q319281) (← links)
- Variable selection for additive partial linear quantile regression with missing covariates (Q321935) (← links)
- Point source super-resolution via non-convex \(L_1\) based methods (Q333212) (← links)
- Variational multiplicative noise removal by DC programming (Q333222) (← links)
- A DC programming approach for planning a multisensor multizone search for a target (Q336797) (← links)
- On the problem of minimizing a difference of polyhedral convex functions under linear constraints (Q346824) (← links)
- Optimization with a class of multivariate integral stochastic order constraints (Q363558) (← links)
- A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors (Q380561) (← links)
- On DC optimization algorithms for solving minmax flow problems (Q406644) (← links)
- An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
- On solving linear complementarity problems by DC programming and DCA (Q409266) (← links)
- Exact penalty and error bounds in DC programming (Q427389) (← links)
- A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495) (← links)
- Behavior of DCA sequences for solving the trust-region subproblem (Q454269) (← links)
- Optimizing a multi-stage production/inventory system by DC programming based approaches (Q461449) (← links)
- Kernel methods in system identification, machine learning and function estimation: a survey (Q462325) (← links)
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) (Q493283) (← links)
- A framework of discrete DC programming by discrete convex analysis (Q494333) (← links)
- The challenge in managing new financial risks: adopting an heuristic or theoretical approach (Q513101) (← links)
- DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
- On global unconstrained minimization of the difference of polyhedral functions (Q540713) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- Properties of two DC algorithms in quadratic programming (Q628748) (← links)
- The directional subdifferential of the difference of two convex functions (Q628751) (← links)
- Self-organizing maps by difference of convex functions optimization (Q736509) (← links)
- New and efficient algorithms for transfer prices and inventory holding policies in two-enterprise supply chains (Q740632) (← links)
- Global optimization from concave minimization to concave mixed variational inequality (Q778156) (← links)
- The ABC of DC programming (Q829493) (← links)
- MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection (Q829724) (← links)
- Optimality conditions for the difference of convex set-valued mappings (Q850590) (← links)
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms (Q889303) (← links)
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
- On the subdifferentiability of the difference of two functions and local minimization (Q1005123) (← links)
- Low order-value optimization and applications (Q1029662) (← links)
- On the degree and separability of nonconvexity and applications to optimization problems (Q1373758) (← links)
- An optimal bound for d. c. programs with convex constraints (Q1396998) (← links)
- Simplicially-constrained DC optimization over efficient and weakly efficient sets (Q1411519) (← links)
- Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach (Q1565934) (← links)
- Exact penalty in d. c. programming (Q1573084) (← 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)
- Three \(l_1\) based nonconvex methods in constructing sparse mean reverting portfolios (Q1635895) (← 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)
- 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)
