default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 81
Volume 81, Number 1, September 2021
- Daniel Aloise
, Gilles Caporossi, Sébastien Le Digabel:
Preface to the special issue of JOGO on the occasion of the 40th anniversary of the Group for Research in Decision Analysis (GERAD). 1-2 - Defeng Liu, Andrea Lodi, Mathieu Tanneau:
Learning chordal extensions. 3-22 - Marilène Cherkesly, Claudio Contardo:
The conditional p-dispersion problem. 23-83 - Ruobing Shen, Bo Tang, Leo Liberti, Claudia D'Ambrosio, Stéphane Canu:
Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice. 85-108 - Ansgar Rössig, Milena Petkovic:
Advances in verification of ReLU neural networks. 109-152 - Alain Hertz, Tsvi Kuflik, Noa Tuval:
Resolving sets and integer programs for recommender systems. 153-178 - Minh Pham, Xiaodong Lin, Andrzej Ruszczynski, Yu Du:
An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems. 179-202 - Juliane Müller, Jangho Park, Reetik Sahu, Charuleka Varadharajan, Bhavna Arora, Boris Faybishenko, Deborah A. Agarwal:
Surrogate optimization of deep neural networks for groundwater predictions. 203-231 - Oktay Günlük, Jayant Kalagnanam, Minhan Li, Matt Menickelly, Katya Scheinberg:
Optimal decision trees for categorical data via integer programming. 233-260 - Charles Audet, Pierre Hansen, Dragutin Svrtan:
Using symbolic calculations to determine largest small polygons. 261-268
Volume 81, Number 2, October 2021
- Kaiwen Ma, Nikolaos V. Sahinidis, Sreekanth Rajagopalan, Satyajith Amaran, Scott J. Bury:
Decomposition in derivative-free optimization. 269-292 - Jacek Gondzio, E. Alper Yildirim:
Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations. 293-321 - Carlo Alberto De Bernardi, Enrico Miglierina:
A variational approach to the alternating projections method. 323-350 - Duong Thi Viet An, Nguyen Dong Yen:
Optimality conditions based on the Fréchet second-order subdifferential. 351-365 - Cheng Lu, Zhibin Deng:
A branch-and-bound algorithm for solving max-k-cut problem. 367-389 - Manish Bansal, Yingqiu Zhang:
Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs. 391-433 - Rashed Khanjani Shiraz, Salman Khodayifar, Panos M. Pardalos:
Copula theory approach to stochastic geometric programming. 435-468 - Roberto Baviera, Giulia Bianchi:
Model risk in mean-variance portfolio selection: an analytic solution to the worst-case approach. 469-491 - Ken Kobayashi, Yuichi Takano, Kazuhide Nakata:
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization. 493-528 - Martina Cerulli, Claudia D'Ambrosio, Leo Liberti, Mercedes Pelegrín:
Detecting and solving aircraft conflicts using bilevel programming. 529-557
Volume 81, Number 3, November 2021
- María López Quijorna:
Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction. 559-598 - Zhiqing Meng, Min Jiang, Rui Shen, Leiyan Xu, Chuangyin Dang:
An objective penalty function method for biconvex programming. 599-620 - Bettina Ponleitner, Hermann Schichl:
Exclusion regions for parameter-dependent systems of equations. 621-644 - Mohammadreza Safi, Seyed Saeed Nabavi, Richard J. Caron:
A modified simplex partition algorithm to test copositivity. 645-658 - Liang Chen, Weikun Chen, Mu-Ming Yang, Yu-Hong Dai:
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron. 659-689 - Jingqun Li, Thia Kirubarajan, Ratnasingham Tharmarasa, Daly Brown, Krishna R. Pattipati:
A dual approach to multi-dimensional assignment problems. 691-716 - Hao Wang, Fan Zhang, Yuanming Shi, Yaohua Hu:
Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods. 717-748 - Jialiang Xu, Yun-Bin Zhao:
Dual-density-based reweighted ℓ 1-algorithms for a class of ℓ 0-minimization problems. 749-772 - Mihály Csaba Markót:
Improved interval methods for solving circle packing problems in the unit square. 773-803 - Banu Kabakulak, Z. Caner Taskin, Ali Emre Pusane:
A branch-cut-and-price algorithm for optimal decoding in digital communication systems. 805-834
Volume 81, Number 4, December 2021
- Fengqiao Luo, Sanjay Mehrotra:
A geometric branch and bound method for robust maximization of convex functions. 835-859 - Andrew Allman, Qi Zhang:
Branch-and-price for a class of nonconvex mixed-integer nonlinear programs. 861-880 - Felipe Lara, Alireza Kabgani:
On global subdifferentials with applications in nonsmooth optimization. 881-900 - Yarui Duan, Song Wang, Yuying Zhou:
A power penalty approach to a mixed quasilinear elliptic complementarity problem. 901-918 - Eduardo Queiroga, Anand Subramanian, Rosa Figueiredo, Yuri Frota:
Integer programming formulations and efficient local search for relaxed correlation clustering. 919-966 - Srinivas Eswar, Ramakrishnan Kannan, Richard W. Vuduc, Haesun Park:
ORCA: Outlier detection and Robust Clustering for Attributed graphs. 967-989 - Ting Tao, Shaohua Pan, Shujun Bi:
Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization. 991-1017 - Chungen Shen, Xiao Liu:
Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations. 1019-1055 - Marcia Fampa, Jon Lee, Gabriel Ponte, Luze Xu:
Experimental analysis of local searches for sparse reflexive generalized inverses. 1057-1093 - Thai Doan Chuong, V. Jeyakumar, Guoyin Li, Daniel Woolnough:
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity. 1095-1117
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 2024-10-31 20:03 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:
