• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 41 matches

• 2021
• 
  Pham Ky Anh, Trinh Ngoc Hai:
  Dynamical system for solving bilevel variational inequalities. J. Glob. Optim. 80(4): 945-963 (2021)
• 
  Kurt M. Anstreicher, Samuel Burer, Kyungchan Park:
  Convex hull representations for bounded products of variables. J. Glob. Optim. 80(4): 757-778 (2021)
• 
  Xueli Bai, Meng-Meng Zheng, Zheng-Hai Huang:
  Unique solvability of weakly homogeneous generalized variational inequalities. J. Glob. Optim. 80(4): 921-943 (2021)
• 
  Emilio Carrizosa, Frédéric Messine:
  An interval branch and bound method for global Robust optimization. J. Glob. Optim. 80(3): 507-522 (2021)
• 
  Emerson V. Castelani, Ronaldo Lopes, Wesley V. I. Shirabayashi, F. N. C. Sobral:
  A robust method based on LOVO functions for solving least squares problems. J. Glob. Optim. 80(2): 387-414 (2021)
• 
  Pin-Bo Chen, Gui-Hua Lin, Xide Zhu, Fusheng Bai:
  Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets. J. Glob. Optim. 80(3): 635-659 (2021)
• 
  Elena Constantin:
  Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization. J. Glob. Optim. 80(1): 177-193 (2021)
• 
  Gabriele Eichfelder, Peter Kirst, Laura Meng, Oliver Stein:
  A general branch-and-bound framework for continuous global multiobjective optimization. J. Glob. Optim. 80(1): 195-227 (2021)
• 
  Gabriele Eichfelder, Peter Kirst, Laura Meng, Oliver Stein:
  Correction to: A general branch-and-bound framework for continuous global multiobjective optimization. J. Glob. Optim. 80(1): 229 (2021)
• 
  Gabriele Eichfelder, Kathrin Klamroth, Julia Niebling:
  Nonconvex constrained optimization by a filtering branch and bound. J. Glob. Optim. 80(1): 31-61 (2021)
• 
  Gabriele Eichfelder, Leo Warnow:
  Proximity measures based on KKT points for constrained multi-objective optimization. J. Glob. Optim. 80(1): 63-86 (2021)
• 
  Sourour Elloumi, Amélie Lambert, Arnaud Lazare:
  Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation. J. Glob. Optim. 80(2): 231-248 (2021)
• 
  Marcia Fampa, Jon Lee:
  Convexification of bilinear forms through non-symmetric lifting. J. Glob. Optim. 80(2): 287-305 (2021)
• 
  Boglárka G.-Tóth, Leocadio G. Casado, Eligius M. T. Hendrix, Frédéric Messine:
  On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic. J. Glob. Optim. 80(4): 779-804 (2021)
• 
  Bennet Gebken, Sebastian Peitz:
  Inverse multiobjective optimization: Inferring decision criteria from data. J. Glob. Optim. 80(1): 3-29 (2021)
• 
  Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
  One-exact approximate Pareto sets. J. Glob. Optim. 80(1): 87-115 (2021)
• 
  Hideaki Iiduka:
  Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning. J. Glob. Optim. 80(2): 479-505 (2021)
• 
  Zehui Jia, Jieru Huang, Xingju Cai:
  Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems. J. Glob. Optim. 80(4): 841-864 (2021)
• 
  Josef Kallrath, Joonghyun Ryu, Chanyoung Song, Mokwon Lee, Deok-Soo Kim:
  Near optimal minimal convex hulls of disks. J. Glob. Optim. 80(3): 551-594 (2021)
• 
  Shiva Kapoor, C. S. Lalitha:
  Essential stability in unified vector optimization. J. Glob. Optim. 80(1): 161-175 (2021)
• 
  Refail Kasimbeyli, Masoud Karimi:
  Duality in nonconvex vector optimization. J. Glob. Optim. 80(1): 139-160 (2021)
• 
  Mikhail Yu. Khachay, Yuri Ogorodnikov, Daniel Khachay:
  Efficient approximation of the metric CVRP in spaces of fixed doubling dimension. J. Glob. Optim. 80(3): 679-710 (2021)
• 
  Timoleon Kipouros:
  Review on the monograph Deterministic Global Optimization: An Introduction to the Diagonal Approach, Springer, 2017, written by Yaroslav D. Sergeyev and Dmitri E. Kvasov. J. Glob. Optim. 80(3): 729-730 (2021)
• 
  Jeffrey Larson, Sven Leyffer, Prashant Palkar, Stefan M. Wild:
  A method for convex black-box integer global optimization. J. Glob. Optim. 80(2): 439-477 (2021)
• 
  Jae-Hyoung Lee, Nithirat Sisarat, Liguo Jiao:
  Multi-objective convex polynomial optimization and semidefinite programming relaxations. J. Glob. Optim. 80(1): 117-138 (2021)
• 
  Frauke Liers, Alexander Martin, Maximilian Merkert, Nick Mertens, Dennis Michaels:
  Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks. J. Glob. Optim. 80(2): 307-340 (2021)
• 
  Jamie A. Manson, Thomas W. Chamberlain, Richard A. Bourne:
  MVMOO: Mixed variable multi-objective optimisation. J. Glob. Optim. 80(4): 865-886 (2021)
• 
  Alejandra Martínez-Moraian, David Orden, Leonidas Palios, Carlos Seara, Pawel Zylinski:
  Optimizing generalized kernels of polygons. J. Glob. Optim. 80(4): 887-920 (2021)
• 
  Kaisa Miettinen, Serpil Sayin:
  Preface of the special issue on global multiobjective optimization. J. Glob. Optim. 80(1): 1-2 (2021)
• 
  Janusz Miroforidis:
  Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems. J. Glob. Optim. 80(3): 617-634 (2021)

skipping 11 more matches