default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 59
Volume 59, Number 1, May 2014
- Evgeny Maslov, Mikhail Batsyn
, Panos M. Pardalos:
Speeding up branch and bound algorithms for solving the maximum clique problem. 1-21 - Remigijus Paulavicius, Julius Zilinskas:
Simplicial Lipschitz optimization without the Lipschitz constant. 23-40 - Shaojian Qu, Mark Goh, Soon-Yi Wu, Robert de Souza:
Multiobjective DC programs with infinite convex constraints. 41-58 - Dinh Quoc Tran, Ion Necoara, Moritz Diehl:
Path-following gradient-based decomposition algorithms for separable convex optimization. 59-80 - Guoqiang Wang, Changjun Yu, Kok Lay Teo:
A full-Newton step feasible interior-point algorithm for $$P_*(\kappa )$$ P ∗ ( κ ) -linear complementarity problems. 81-99 - Florence Jules, Marc Lassonde:
Subdifferential test for optimality. 101-106 - Stéphane Puechmorel, Daniel Delahaye:
Order statistics and region-based evolutionary computation. 107-130 - Igor V. Konnov:
On penalty methods for non monotone equilibrium problems. 131-138 - Thanh Qui Nguyen:
Stability for trust-region methods via generalized differentiation. 139-164 - Soon-Mo Jung, Dorian Popa, Michael Th. Rassias:
On the stability of the linear functional equation in a single variable on complete metric groups. 165-171 - Phan Tu Vuong, Jean-Jacques Strodiot, Van Hien Nguyen:
Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces. 173-190 - C. S. Lalitha, Prashanto Chatterjee:
Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems. 191-205
Volume 59, Numbers 2-3, July 2014
- Oleg A. Prokopyev, Nikolaos V. Sahinidis:
Preface: Honoring the 60th birthday of Panos M. Pardalos. 207 - Hoai An Le Thi, Ngai Van Huynh, Tao Pham Dinh, A. Ismael F. Vaz, Luís Nunes Vicente:
Globally convergent DC trust-region methods. 209-225 - Miguel F. Anjos, Xiao-Wen Chang, Wen-Yang Ku:
Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems. 227-242 - Immanuel M. Bomze, Stefan Gollowitzer, E. Alper Yildirim:
Rounding on the standard simplex: regular grids for global optimization. 243-258 - Michael R. Bussieck, Steven P. Dirkse, Stefan Vigerske:
PAVER 2.0: an open source environment for automated performance analysis of benchmarking data. 259-275 - Pedro M. Castro, Ignacio E. Grossmann:
Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems. 277-306 - Luís M. Fernandes, Joaquim João Júdice, Hanif D. Sherali, Masao Fukushima:
On the computation of all eigenvalues for the eigenvalue complementarity problem. 307-326 - William W. Hager, Delphine Mico-Umutesi:
Error estimation in nonlinear optimization. 327-341 - Mahdi Hamzeei, James R. Luedtke:
Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation. 343-365 - Donald R. Jones:
A fully general, exact algorithm for nesting irregular shapes. 367-404 - Josef Kallrath, Steffen Rebennack:
Cutting ellipses from area-minimizing rectangles. 405-437 - Kittipat Kampa, Sonya H. Mehta, Chun-An Chou, Wanpracha Art Chaovalitwongse, Thomas J. Grabowski:
Sparse optimization in feature selection: application in neuroimaging. 439-457 - Ralph Baker Kearfott:
On rigorous upper bounds to a global optimum. 459-476 - Marco Locatelli:
A technique to derive the analytical form of convex envelopes for some bivariate functions. 477-501 - Ruth Misener, Christodoulos A. Floudas:
ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations. 503-526 - Richard Oberdieck, Martina Wittmann-Hohlbein, Efstratios N. Pistikopoulos:
A branch and bound method for the solution of multiparametric mixed integer linear programming problems. 527-543 - Remigijus Paulavicius, Yaroslav D. Sergeyev, Dmitri E. Kvasov, Julius Zilinskas:
Globally-biased Disimpl algorithm for expensive global optimization. 545-567 - Hermann Schichl, Mihály Csaba Markót, Arnold Neumaier:
Exclusion regions for optimization problems. 569-595 - Srikrishna Sridhar, Jeffrey T. Linderoth, James R. Luedtke:
Models and solution techniques for production planning problems with increasing byproducts. 597-631 - Angelos Tsoukalas, Alexander Mitsos:
Multivariate McCormick relaxations. 633-662 - Zhao Zhang, Weili Wu, Lidan Fan, Ding-Zhu Du:
Minimum vertex cover in ball graphs through local search. 663-671 - Keith Zorn, Nikolaos V. Sahinidis:
Global optimization of general nonconvex problems with intermediate polynomial substructures. 673-693
Volume 59, Number 4, August 2014
- Huixian Wu, Hezhi Luo, Jianfang Yang:
Nonlinear separation approach for the augmented Lagrangian in nonlinear semidefinite programming. 695-727 - Anulekha Dhara, Dinh The Luc:
A solution method for linear variational relation problems. 729-756 - Tadeusz Antczak:
On efficiency and mixed duality for a new class of nonconvex multiobjective variational control problems. 757-785 - José Yunier Bello Cruz, Welington de Oliveira:
Level bundle-like algorithms for convex optimization. 787-809 - Andreas H. Hamel, Andreas Löhne, Birgit Rudloff:
Benson type algorithms for linear vector optimization and applications. 811-836 - Nguyen Dinh, Guy Vallet, Michel Volle:
Functional inequalities and theorems of the alternative involving composite functions. 837-863 - Juliane Müller, Christine A. Shoemaker, Robert Piché:
SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications. 865-889
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-20 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
