Pages that link to "Item:Q1368737"
From MaRDI portal
The following pages link to Solving a class of linearly constrained indefinite quadratic problems by DC algorithms (Q1368737):
Displaying 50 items.
- Coderivatives of implicit multifunctions and stability of variational systems (Q300771) (← links)
- DCA based algorithms for multiple sequence alignment (MSA) (Q301241) (← links)
- DC approximation approaches for sparse optimization (Q319281) (← links)
- Testing copositivity with the help of difference-of-convex optimization (Q359631) (← 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)
- 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)
- Shakedown analysis with multidimensional loading spaces (Q424938) (← links)
- Exact penalty and error bounds in DC programming (Q427389) (← links)
- Behavior of DCA sequences for solving the trust-region subproblem (Q454269) (← links)
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms (Q477981) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- Properties of two DC algorithms in quadratic programming (Q628748) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- Self-organizing maps by difference of convex functions optimization (Q736509) (← links)
- Double regularization methods for robust feature selection and SVM classification via DC programming (Q781867) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← 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)
- New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Several multi-criteria programming methods for classification (Q955617) (← links)
- DC programming and DCA for globally solving the value-at-risk (Q1035285) (← 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)
- Robust relevance vector machine for classification with variational inference (Q1639214) (← links)
- Expectile regression for analyzing heteroscedasticity in high dimension (Q1640971) (← 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)
- Penalized principal logistic regression for sparse sufficient dimension reduction (Q1654232) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- Global convergence of proximal iteratively reweighted algorithm (Q1675580) (← links)
- A doubly sparse approach for group variable selection (Q1680797) (← links)
- Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← 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)
