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.
- On the problem polyhedral separability: a numerical solution (Q268664) (← links)
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
- On local search in d.c. optimization problems (Q299416) (← links)
- DCA based algorithms for multiple sequence alignment (MSA) (Q301241) (← links)
- DC approximation approaches for sparse optimization (Q319281) (← links)
- On numerical solving the spherical separability problem (Q330492) (← links)
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← 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)
- Supervised classification and mathematical optimization (Q339559) (← links)
- Optimization with a class of multivariate integral stochastic order constraints (Q363558) (← links)
- DCA for solving the scheduling of lifting vehicle in an automated port container terminal (Q373199) (← links)
- A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors (Q380561) (← links)
- Total Lagrange duality for DC infinite optimization problems (Q401875) (← 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)
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces (Q413608) (← links)
- Shakedown analysis with multidimensional loading spaces (Q424938) (← links)
- Exact penalty and error bounds in DC programming (Q427389) (← links)
- A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495) (← links)
- The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Optimizing a multi-stage production/inventory system by DC programming based approaches (Q461449) (← links)
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms (Q477981) (← links)
- Solving DC programs using the cutting angle method (Q486726) (← links)
- DCA based algorithms for feature selection in multi-class support vector machine (Q513636) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- DC models for spherical separation (Q604962) (← 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)
- Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches (Q691466) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← 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)
- Error bounds for the difference of two convex multifunctions (Q742196) (← links)
- Functional inequalities and theorems of the alternative involving composite functions (Q743970) (← links)
- Double regularization methods for robust feature selection and SVM classification via DC programming (Q781867) (← links)
- Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces (Q824790) (← links)
- MM algorithms for distance covariance based sufficient dimension reduction and sufficient variable selection (Q829724) (← links)
- Community detection via an efficient nonconvex optimization approach based on modularity (Q830497) (← links)
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
- DC programming techniques for solving a class of nonlinear bilevel programs (Q839322) (← links)
- On difference of two monotone operators (Q839795) (← links)
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms (Q889303) (← links)
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm (Q890292) (← links)
- New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
- Efficient estimation of approximate factor models via penalized maximum likelihood (Q898581) (← links)
- On the difference of two maximal monotone operators: Regularization and algorithmic approaches (Q942362) (← links)
