The following pages link to Hoai An Le Thi (Q246839):
Displayed 50 items.
- DCA based algorithms for multiple sequence alignment (MSA) (Q301241) (← links)
- (Q319277) (redirect page) (← links)
- DC approximation approaches for sparse optimization (Q319281) (← links)
- A DC programming approach for planning a multisensor multizone search for a target (Q336797) (← links)
- A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors (Q380561) (← 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)
- A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints (Q445789) (← links)
- A DC programming approach for a class of bilevel programming problems and its application in portfolio selection (Q449555) (← links)
- Nonsmooth semi-infinite programming problem using limiting subdifferentials (Q454252) (← 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)
- (Q477978) (redirect page) (← links)
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms (Q477981) (← 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)
- Outer-inner approximation projection methods for multivalued variational inequalities (Q514057) (← links)
- (Q592154) (redirect page) (← links)
- D.C. programming approach for multicommodity network optimization problems with step increasing cost functions (Q598597) (← 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)
- Duality for nonsmooth semi-infinite programming problems (Q691458) (← links)
- Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches (Q691466) (← links)
- Error bounds via exact penalization with applications to concave and quadratic systems (Q727233) (← 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)
- DC programming techniques for solving a class of nonlinear bilevel programs (Q839322) (← 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)
- 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)
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems (Q1273054) (← links)
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms (Q1368737) (← links)
- Convex analysis approach to d. c. programming: Theory, algorithms and applications (Q1384439) (← links)
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems (Q1386483) (← links)
- Solving an inverse problem for an elliptic equation by d.c. programming (Q1411331) (← links)
- Simplicially-constrained DC optimization over efficient and weakly efficient sets (Q1411519) (← links)
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming (Q1430176) (← links)
- Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach (Q1565934) (← links)
- Exact penalty in d. c. programming (Q1573084) (← links)
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints (Q1575066) (← links)
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model (Q1642987) (← 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)
- Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)