Result 1 to 20 of 75 total
Optimum multi-user detection by nonsmooth optimization (English)
ICASSP, 3444-3447 (2011).
1
${{\mathcal {D}(\mathcal {C})}}$-optimization and robust global optimization. (English)
J. Glob. Optim. 47, No. 3, 485-501 (2010).
2
Concave programming and DH-point. (English)
J. Glob. Optim. 43, No. 2-3, 407-413 (2009).
3
D.C. programming (English)
Encyclopedia of Optimization, 607-612 (2009).
4
Global optimization in location problems (English)
Encyclopedia of Optimization, 1354-1359 (2009).
5
Cutting plane methods for global optimization (English)
Encyclopedia of Optimization, 590-594 (2009).
6
Decomposition in global optimization (English)
Encyclopedia of Optimization, 627-630 (2009).
7
Robust global optimization (English)
Encyclopedia of Optimization, 3314-3317 (2009).
8
A novel approach to bilevel nonlinear programming. (English)
J. Glob. Optim. 38, No. 4, 527-554 (2007).
9
On a decomposition method for nonconvex global optimization. (English)
Optim. Lett. 1, No. 3, 245-258 (2007).
10
A robust algorithm for quadratic optimization under quadratic constraints. (English)
J. Glob. Optim. 37, No. 4, 557-569 (2007).
11
On a decomposition method for nonconvex global optimization (English)
Optimization Letters 1, No. 3, 245-258 (2007).
12
Optimization under composite monotonic constraints and constrained optimization over the efficient set. (English)
Liberti, Leo et al., Global optimization. From theory to implementation. New York, NY: Springer (ISBN 0-387-28260-2/hbk). Nonconvex Optimization and Its Applications 84, 3-31 (2006).
13
Discrete monotonic optimization with application to a discrete location problem. (English)
SIAM J. Optim. 17, No. 1, 78-97 (2006).
14
Discrete monotonic optimization with application to a discrete location problem (English)
SIAM Journal on Optimization 17, No. 1, 78-97 (2006).
15
Monotonic optimization: branch and cut methods. (English)
Audet, Charles (ed.) et al., Essays and surveys in global optimization. New York, NY: Springer (ISBN 0-387-25569-9/hbk). GERAD 25th Anniversary Series 7, 39-78 (2005).
16
On solving nonconvex optimization problems by reducing the duality gap. (English)
J. Glob. Optim. 32, No. 3, 349-365 (2005).
17
Polynomial optimization: a robust approach. (English)
Pac. J. Optim. 1, No. 2, 357-373 (2005).
18
Minimax theorems revisited. (English)
Acta Math. Vietnam. 29, No. 3, 217-229 (2004).
19
Cutting plane algorithms for nonlinear semi-definite programming problems with applications. (English)
J. Glob. Optim. 25, No.2, 141-155 (2003).
20
Result 1 to 20 of 75 total
Start
Contact
Print
General Help
