default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 72
Volume 72, Number 1, September 2018
- Farid Alizadeh, Douglas Soares Gonçalves
, Nathan Krislock, Leo Liberti:
Preface: Special issue dedicated to Distance Geometry. 1-4 - Shimeng Huang, Henry Wolkowicz:
Low-rank matrix completion using nuclear norm minimization and facial reduction. 5-26 - Leonardo Fontoura, Rafael Martinelli, Marcus Poggi, Thibaut Vidal:
The minimum distance superset problem: formulations and algorithms. 27-53 - Cláudio P. Santiago, Carlile Lavor, Sérgio Assunção Monteiro, Alberto Krone-Martins:
A new algorithm for the small-field astrometric point-pattern matching problem. 55-70 - David Kirszenblat, K. G. Sirinanda, Marcus Brazil, Peter Alexander Grossman, J. Hyam Rubinstein, Doreen A. Thomas:
Minimal curvature-constrained networks. 71-87 - Luiz Henrique Cherri, Adriana Cristina Cherri, Edilaine Martins Soler:
Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations. 89-107 - Bradley Worley, Florent Delhommel, Florence Cordier, Thérèse E. Malliavin, Benjamin Bardiaux, Nicolas Wolff, Michael Nilges, Carlile Lavor, Leo Liberti:
Tuning interval Branch-and-Prune for protein structure determination. 109-127
Volume 72, Number 2, October 2018
- Emily Speakman, Jon Lee:
On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation. 129-153 - Ovidiu Bagdasar, Nicolae Popovici:
Unifying local-global type properties in vector optimization. 155-179 - Stefan C. Endres, Carl Sandrock, Walter W. Focke:
A simplicial homology algorithm for Lipschitz optimisation. 181-217 - Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko:
A nonconvex quadratic optimization approach to the maximum edge weight clique problem. 219-240 - Zachary Charles, Nigel Boston:
Exploiting algebraic structure in global optimization and the Belgian chocolate problem. 241-254 - Carlos J. Nohra, Nikolaos V. Sahinidis:
Global optimization of nonconvex problems with convex-transformable intermediates. 255-276 - Marco Locatelli:
Convex envelopes of bivariate functions through the solution of KKT systems. 277-303 - Ivo Nowak, Norman Breitfeld, Eligius M. T. Hendrix, Grégoire Njacheun-Njanzoua:
Decomposition-based Inner- and Outer-Refinement Algorithms for Global Optimization. 305-321 - Ana Luísa Custódio, Jose Firmino Aguilar Madeira:
MultiGLODS: global and local multiobjective optimization using direct search. 323-345 - Daniel Ciripoi, Andreas Löhne, Benjamin Weißing:
A vector linear programming approach for certain global optimization problems. 347-372
Volume 72, Number 3, November 2018
- Amir Beck, Yuval Beck, Yoash Levron, Alex Shtof, Luba Tetruashvili:
Globally solving a class of optimal power flow problems in radial networks by tree reduction. 373-402 - Outi Montonen, Kaisa Joki:
Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints. 403-429 - Ke Guo, Deren Han:
A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions. 431-441 - Minh N. Dao, Hung M. Phan:
Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems. 443-474 - Ignacy Kaliszewski, Janusz Miroforidis:
On upper approximations of Pareto fronts. 475-490 - Andrea Patanè, Andrea Santoro, Vittorio Romano, Antonino La Magna, Giuseppe Nicosia:
Enhancing quantum efficiency of thin-film silicon solar cells by Pareto optimality. 491-515 - Yixin Zhao, Torbjörn Larsson, Elina Rönnberg, Panos M. Pardalos:
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation. 517-538 - Junlei Zhu, Yuehua Bu, Panayote M. Pardalos, Hongwei Du, Huijuan Wang, Bin Liu:
Optimal channel assignment and L(p, 1)-labeling. 539-552 - Laurentiu Leustean, Adriana Nicolae, Andrei Sipos:
An abstract proximal point algorithm. 553-577 - Monica Bianchi, Igor Konnov, Rita Pini:
Limit vector variational inequality problems via scalarization. 579-590 - João Xavier da Cruz Neto, F. M. O. Jacinto, P. A. Soares Jr., João Carlos de Oliveira Souza:
On maximal monotonicity of bifunctions on Hadamard manifolds. 591-601
Volume 72, Number 4, December 2018
- Kurt M. Anstreicher:
Maximum-entropy sampling and the Boolean quadric polytope. 603-618 - Naoki Ito, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Kim-Chuan Toh:
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems. 619-653 - Thai Doan Chuong, Vaithilingam Jeyakumar:
Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers. 655-678 - Yulan Liu, Shujun Bi, Shaohua Pan:
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems. 679-704 - Wondi Geremew, Nguyen Mau Nam, Alexander Semenov, Vladimir Boginski, Eduardo L. Pasiliao:
A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique. 705-729 - Firdevs Ulus:
Tractability of convex vector optimization problems in the sense of polyhedral approximations. 731-742 - Vikas Vikram Singh, Abdel Lisser:
Variational inequality formulation for the games with random payoffs. 743-760 - Stanislaw Migórski, Shengda Zeng:
A class of differential hemivariational inequalities in Banach spaces. 761-779 - Warren L. Hare, Jason L. Loeppky, Shangwei Xie:
Methods to compare expensive stochastic optimization algorithms with random restarts. 781-801
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-07-13 19:26 CEST 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:
