The following pages link to Hoang Tuy (Q166199):
Displayed 50 items.
- Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems (Q1376657) (← links)
- Professor Le Van Thiem (1918--1991) (Q1396071) (← links)
- A monotonicity based approach to nonconvex quadratic minimization (Q1399081) (← links)
- On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications (Q1411319) (← links)
- A unified monotonic approach to generalized linear fractional programming (Q1422886) (← links)
- A discrete location problem (Q1433487) (← links)
- Normal sets, polyblocks, and monotonic optimization (Q1573518) (← links)
- Strong polynomial-time solvability of a minimum concave cost network flow problem. (Q1582279) (← links)
- Decomposition algorithm for reverse convex programs (Q1593688) (← links)
- Recent developments and trends in global optimization (Q1593827) (← links)
- Reverse polyblock approximation for generalized multiplicative/fractional programming (Q1762797) (← links)
- Minimax theorems revisited (Q1775427) (← links)
- Monotonic optimization for sensor cover energy problem (Q1800445) (← links)
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
- Optimization of polynomial fractional functions (Q1888159) (← links)
- A d.c. optimization method for single facility location problems (Q1904649) (← links)
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
- Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
- Monotonic optimization based decoding for linear codes (Q1941018) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
- On a decomposition method for nonconvex global optimization (Q2463828) (← links)
- On solving nonconvex optimization problems by reducing the duality gap (Q2494287) (← links)
- Almost affine functions (Q2550359) (← links)
- Robust solution of nonconvex global optimization problems (Q2576450) (← links)
- Monotonic Optimization: Problems and Solution Approaches (Q2706339) (← links)
- An alogrithm for monotonic global optimization problems<sup>∗</sup> (Q2720273) (← links)
- (Q2722336) (← links)
- DC optimization approach to robust controls: the optimal scaling value problem (Q2730265) (← links)
- (Q2768045) (← links)
- (Q2768076) (← links)
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming (Q2770097) (← links)
- (Q3259774) (← links)
- (Q3262879) (← links)
- Solving the linear complementarity problem through concave programming (Q3346107) (← links)
- (Q3363072) (← links)
- (Q3515444) (← links)
- (Q3528688) (← links)
- On variable dimension algorithms and algorithms using primitive sets (Q3666604) (← links)
- (Q3686446) (← links)
- (Q3693282) (← links)
- (Q3703598) (← links)
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set (Q3703662) (← links)
- Concave minimization under linear constraints with special structure (Q3710317) (← links)
- Global minimization of a difference of two convex functions (Q3757698) (← links)
- Global optimization under Lipschitzian constraints (Q3760303) (← links)
- (Q3761588) (← links)
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization (Q3778553) (← links)
- Parametric approach to a class of nonconvex global optimization problems (Q3787803) (← links)