Content
October 2022, Volume 84, Issue 2
- 491-523 Multidimensional Assignment Problem for Multipartite Entity Resolution
by Alla Kammerdiner & Alexander Semenov & Eduardo L. Pasiliao - 525-526 Correction to: Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization
by M. Bianchi & G. Kassay & R. Pini
September 2022, Volume 84, Issue 1
- 1-41 The supporting hyperplane optimization toolkit for convex MINLP
by Andreas Lundell & Jan Kronqvist & Tapio Westerlund - 43-76 The p-Lagrangian relaxation for separable nonconvex MIQCQP problems
by Tiago Andrade & Nikita Belyak & Andrew Eberhard & Silvio Hamacher & Fabricio Oliveira - 77-93 Fractional 0–1 programming and submodularity
by Shaoning Han & Andrés Gómez & Oleg A. Prokopyev - 95-117 Finding non dominated points for multiobjective integer convex programs with linear constraints
by Lamia Zerfa & Mohamed El-Amine Chergui - 119-135 Covering a simplex by spheres: complexity and algorithms
by Tongli Zhang & Yong Xia - 137-147 Sufficient conditions for existence of global minimizers of functions on Hilbert spaces
by Liang Chen & Yu-Hong Dai & Zhou Wei - 149-176 On the global minimization of discretized residual functionals of conditionally well-posed inverse problems
by M. Yu. Kokurin - 177-203 The projected polar proximal point algorithm converges globally
by Scott B. Lindstrom - 205-228 Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization
by Nguyen Xuan Duy Bao & Phan Quoc Khanh & Nguyen Minh Tung - 229-253 Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
by Xianpeng Mao & Yuning Yang
August 2022, Volume 83, Issue 4
- 639-670 Multiple instance classification via quadratic programming
by Emel Şeyma Küçükaşcı & Mustafa Gökçe Baydoğan & Z. Caner Taşkın - 671-697 An approximate lower order penalty approach for solving second-order cone linear complementarity problems
by Zijun Hao & Chieu Thanh Nguyen & Jein-Shan Chen - 699-725 Solving non-monotone equilibrium problems via a DIRECT-type approach
by Stefano Lucidi & Mauro Passacantando & Francesco Rinaldi - 727-751 Maximizing a non-decreasing non-submodular function subject to various types of constraints
by Cheng Lu & Wenguo Yang & Ruiqi Yang & Suixiang Gao - 753-781 Global convergence of model function based Bregman proximal minimization algorithms
by Mahesh Chandra Mukkamala & Jalal Fadili & Peter Ochs - 783-801 Sparse signal recovery via generalized gaussian function
by Haiyang Li & Qian Zhang & Shoujin Lin & Jigen Peng - 803-824 The robust bilevel continuous knapsack problem with uncertain coefficients in the follower’s objective
by Christoph Buchheim & Dorothee Henke - 825-842 Consistency of statistical estimators of solutions to stochastic optimization problems
by Huynh Thi Hong Diem - 843-863 LR-NIMBUS: an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions
by Javad Koushki & Kaisa Miettinen & Majid Soleimani-damaneh - 865-889 Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations
by Bhupinder Singh Saini & Michael Emmerich & Atanu Mazumdar & Bekir Afsar & Babooshka Shavazipour & Kaisa Miettinen - 891-908 Numerical certification of Pareto optimality for biobjective nonlinear problems
by Charles Audet & Frédéric Messine & Jordan Ninin - 909-910 Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems
by Charles Audet & Frédéric Messine & Jordan Ninin
July 2022, Volume 83, Issue 3
- 403-404 Special Issue: 18th International conference on mathematical optimization theory and operations research (MOTOR 2019)
by Panos M. Pardalos & Michael Khachay & Yuri Kochetov - 405-444 A variable neighborhood search algorithm for the $$ (r{\mid }p) $$ ( r ∣ p ) hub–centroid problem under the price war
by Dimitrije D. Čvokić & Yury A. Kochetov & Aleksandr V. Plyasunov & Aleksandar Savić - 445-456 On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
by Alexander Kononov & Julia Memar & Yakov Zinder - 457-480 On strong duality in linear copositive programming
by O. I. Kostyukova & T. V. Tchemisova - 481-495 Critical sets, crowns and local maximum independent sets
by Vadim E. Levit & Eugen Mandrescu - 497-519 A regularized point cloud registration approach for orthogonal transformations
by Artyom Makovetskii & Sergei Voronin & Vitaly Kober & Aleksei Voronin - 521-537 Dynamic multicriteria games with asymmetric players
by Anna N. Rettieva - 539-564 Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
by Alexander Kononov & Yulia Zakharova - 565-584 Hospital service levels during drug shortages: Stocking and transshipment policies for pharmaceutical inventory
by Cem Deniz Caglar Bozkir & O. Erhun Kundakcioglu & Andrea C. Henry - 585-613 Multi-stage portfolio selection problem with dynamic stochastic dominance constraints
by Yu Mei & Zhiping Chen & Jia Liu & Bingbing Ji - 615-638 Supply chain networks, wages, and labor productivity: insights from Lagrange. analysis and computations
by Anna Nagurney
June 2022, Volume 83, Issue 2
- 187-200 A revision of the rectangular algorithm for a class of DC optimization problems
by Takahito Kuno - 201-220 Exact and approximate results for convex envelopes of special structured functions over simplices
by M. Locatelli - 221-233 On the branch and bound algorithm for the extended trust-region subproblem
by Saeid Ansary Karbasy & Maziar Salahi - 235-247 A new greedy strategy for maximizing monotone submodular function under a cardinality constraint
by Cheng Lu & Wenguo Yang & Suixiang Gao - 249-271 Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces
by Regina S. Burachik & Yaohua Hu & Xiaoqi Yang - 273-299 A Newton Frank–Wolfe method for constrained self-concordant minimization
by Deyi Liu & Volkan Cevher & Quoc Tran-Dinh - 301-327 Convex projection and convex multi-objective optimization
by Gabriela Kováčová & Birgit Rudloff - 329-357 An approximation algorithm for multi-objective optimization problems using a box-coverage
by Gabriele Eichfelder & Leo Warnow - 359-376 Stable global well-posedness and global strong metric regularity
by Xi Yin Zheng & Jiangxing Zhu - 377-402 Higher-order set-valued Hadamard directional derivatives: calculus rules and sensitivity analysis of equilibrium problems and generalized equations
by Nguyen Minh Tung & Nguyen Xuan Duy Bao
May 2022, Volume 83, Issue 1
- 1-2 Preface: special issue on optimization in distance geometry
by Andrés D. Báez-Sánchez & Carlile Lavor & Antonio Mucherino - 3-28 NMR assignment through linear programming
by José F. S. Bravo-Ferreira & David Cowburn & Yuehaw Khoo & Amit Singer - 29-47 Maximum feasible subsystems of distance geometry constraints
by Maurizio Bruglieri & Roberto Cordone & Leo Liberti - 49-71 Which graphs are rigid in $$\ell _p^d$$ ℓ p d ?
by Sean Dewar & Derek Kitson & Anthony Nixon - 73-82 Unassigned distance geometry and molecular conformation problems
by Phil Duxbury & Carlile Lavor & Leo Liberti & Luiz Leduino Salles-Neto - 83-118 Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
by Leo Liberti & Benedetto Manca - 119-136 Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in $$\mathbb {R}^d$$ R d
by Hacene Ouzia & Nelson Maculan - 137-162 An exact algorithm for constructing minimum Euclidean skeletons of polygons
by Nicolau Andrés-Thió & Marcus Brazil & Charl Ras & Doreen Thomas & Marcus Volz - 163-185 Global exact optimization for covering a rectangle with 6 circles
by Sonia Cafieri & Pierre Hansen & Frédéric Messine
April 2022, Volume 82, Issue 4
- 655-657 Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8–10, 2019
by Hoai An Le Thi & Tao Pham Dinh & Yaroslav D. Sergeyev - 659-689 New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
by Mohand Bentobache & Mohamed Telli & Abdelkader Mokhtari - 691-726 A binary search algorithm for univariate data approximation and estimation of extrema by piecewise monotonic constraints
by Ioannis C. Demetriou - 727-751 Low-rank matrix recovery with Ky Fan 2-k-norm
by Xuan Vinh Doan & Stephen Vavasis - 753-802 Global sensing search for nonlinear global optimization
by Abdel-Rahman Hedar & Wael Deabes & Hesham H. Amin & Majid Almaraashi & Masao Fukushima - 803-834 Asynchronous optimization of part logistics routing problem
by Yaoting Huang & Boyu Chen & Wenlian Lu & Zhong-Xiao Jin & Ren Zheng - 835-862 Gaining or losing perspective
by Jon Lee & Daphne Skipper & Emily Speakman - 863-896 Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
by Andreas Lundell & Jan Kronqvist - 897-928 Alternating DC algorithm for partial DC programming problems
by Tao Pham Dinh & Van Ngai Huynh & Hoai An Le Thi & Vinh Thanh Ho - 929-949 On stationarity for nonsmooth multiobjective problems with vanishing constraints
by Ali Sadeghieh & Nader Kanzi & Giuseppe Caristi & David Barilla - 951-964 Characterization results of solutions in interval-valued optimization problems with mixed constraints
by Savin Treanţă - 965-992 Integrating $$\varepsilon $$ ε -dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems
by Wenyu Wang & Taimoor Akhtar & Christine A. Shoemaker - 993-1013 Optimal deterministic and robust selection of electricity contracts
by David Wu & Viet Hung Nguyen & Michel Minoux & Hai Tran - 1015-1052 Graph, clique and facet of boolean logical polytope
by Kedong Yan & Hong Seo Ryoo - 1053-1070 On canonical duality theory and constrained optimization problems
by Constantin Zălinescu
March 2022, Volume 82, Issue 3
- 433-462 Review and comparison of algorithms and software for mixed-integer derivative-free optimization
by Nikolaos Ploskas & Nikolaos V. Sahinidis - 463-482 Sparse regularization via bidualization
by Amir Beck & Yehonathan Refael - 483-498 Brezis pseudomonotone bifunctions and quasi equilibrium problems via penalization
by M. Bianchi & G. Kassay & R. Pini - 499-522 Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities
by Zhong-bao Wang & Xue Chen & Jiang Yi & Zhang-you Chen - 523-557 Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems
by Bing Tan & Xiaolong Qin & Jen-Chih Yao - 559-576 Generalized $${\varepsilon }$$ ε -quasi solutions of set optimization problems
by C. Gutiérrez & R. López & J. Martínez - 577-594 Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
by Xiaopeng Zhao & Jen-Chih Yao - 595-614 Multi-objective dynamic programming with limited precision
by L. Mandow & J. L. Perez-de-la-Cruz & N. Pozas - 615-626 A note on completely positive relaxations of quadratic problems in a multiobjective framework
by Gabriele Eichfelder & Patrick Groetzner - 627-653 Global optimization for the multilevel European gas market system with nonlinear flow models on trees
by Lars Schewe & Martin Schmidt & Johannes Thürauf
February 2022, Volume 82, Issue 2
- 219-242 On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
by S. Lämmel & V. Shikhman - 243-262 Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
by Godai Azuma & Mituhiro Fukuda & Sunyoung Kim & Makoto Yamashita - 263-281 Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control
by Jorn H. Baayen & Krzysztof Postek - 283-312 Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
by Rok Hribar & Timotej Hrga & Gregor Papa & Gašper Petelin & Janez Povh & Nataša Pržulj & Vida Vukašinović - 313-329 An extension of the proximal point algorithm beyond convexity
by Sorin-Mihai Grad & Felipe Lara - 331-349 A unified Douglas–Rachford algorithm for generalized DC programming
by Chih-Sheng Chuang & Hongjin He & Zhiyuan Zhang - 351-373 Conical averagedness and convergence analysis of fixed point algorithms
by Sedi Bartz & Minh N. Dao & Hung M. Phan - 375-387 Improperly efficient solutions in a class of vector optimization problems
by Nguyen Thi Thu Huong & Nguyen Dong Yen - 389-412 Existence results for solutions of mixed tensor variational inequalities
by Wenjie Mu & Jianghua Fan - 413-432 Adaptive seeding for profit maximization in social networks
by Chuangen Gao & Shuyang Gu & Jiguo Yu & Hai Du & Weili Wu
January 2022, Volume 82, Issue 1
- 1-20 An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
by E. Alper Yıldırım - 21-50 Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
by Jianyuan Zhai & Fani Boukouvala - 51-81 Augmented Lagrangian method for second-order cone programs under second-order sufficiency
by Nguyen T. V. Hang & Boris S. Mordukhovich & M. Ebrahim Sarabi - 83-103 An efficient alternating minimization method for fourth degree polynomial optimization
by Haibin Chen & Hongjin He & Yiju Wang & Guanglu Zhou - 105-118 On reduction of exhausters via a support function representation
by Didem Tozkan - 119-138 Strict directional solutions in vectorial problems: necessary optimality conditions
by Mohamed Ait Mansour & Marius Durea & Hassan Riahi - 139-159 Error bound analysis for vector equilibrium problems with partial order provided by a polyhedral cone
by Nguyen Van Hung & Vicente Novo & Vo Minh Tam - 161-177 Variational rationality, variational principles and the existence of traps in a changing environment
by Majid Fakhar & Mohammadreza Khodakhah & Ali Mazyaki & Antoine Soubeyran & Jafar Zafarani - 179-194 Maximization problems of balancing submodular relevance and supermodular diversity
by Zhicheng Liu & Longkun Guo & Donglei Du & Dachuan Xu & Xiaoyan Zhang - 195-217 Identification of mechanical properties of arteries with certification of global optimality
by Jan-Lucas Gade & Carl-Johan Thore & Jonas Stålhand
December 2021, Volume 81, Issue 4
- 835-859 A geometric branch and bound method for robust maximization of convex functions
by Fengqiao Luo & Sanjay Mehrotra - 861-880 Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
by Andrew Allman & Qi Zhang - 881-900 On global subdifferentials with applications in nonsmooth optimization
by Felipe Lara & Alireza Kabgani - 901-918 A power penalty approach to a mixed quasilinear elliptic complementarity problem
by Yarui Duan & Song Wang & Yuying Zhou - 919-966 Integer programming formulations and efficient local search for relaxed correlation clustering
by Eduardo Queiroga & Anand Subramanian & Rosa Figueiredo & Yuri Frota - 967-989 ORCA: Outlier detection and Robust Clustering for Attributed graphs
by Srinivas Eswar & Ramakrishnan Kannan & Richard Vuduc & Haesun Park - 991-1017 Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization
by Ting Tao & Shaohua Pan & Shujun Bi - 1019-1055 Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
by Chungen Shen & Xiao Liu - 1057-1093 Experimental analysis of local searches for sparse reflexive generalized inverses
by Marcia Fampa & Jon Lee & Gabriel Ponte & Luze Xu - 1095-1117 Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
by T. D. Chuong & V. Jeyakumar & G. Li & D. Woolnough
November 2021, Volume 81, Issue 3
- 559-598 Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
by María López Quijorna - 599-620 An objective penalty function method for biconvex programming
by Zhiqing Meng & Min Jiang & Rui Shen & Leiyan Xu & Chuangyin Dang - 621-644 Exclusion regions for parameter-dependent systems of equations
by Bettina Ponleitner & Hermann Schichl - 645-658 A modified simplex partition algorithm to test copositivity
by Mohammadreza Safi & Seyed Saeed Nabavi & Richard J. Caron - 659-689 An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
by Liang Chen & Wei-Kun Chen & Mu-Ming Yang & Yu-Hong Dai - 691-716 A dual approach to multi-dimensional assignment problems
by Jingqun Li & Thia Kirubarajan & R. Tharmarasa & Daly Brown & Krishna R. Pattipati - 717-748 Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods
by Hao Wang & Fan Zhang & Yuanming Shi & Yaohua Hu - 749-772 Dual-density-based reweighted $$\ell _{1}$$ ℓ 1 -algorithms for a class of $$\ell _{0}$$ ℓ 0 -minimization problems
by Jialiang Xu & Yun-Bin Zhao - 773-803 Improved interval methods for solving circle packing problems in the unit square
by Mihály Csaba Markót - 805-834 A branch-cut-and-price algorithm for optimal decoding in digital communication systems
by Banu Kabakulak & Z. Caner Taşkın & Ali Emre Pusane
October 2021, Volume 81, Issue 2
- 269-292 Decomposition in derivative-free optimization
by Kaiwen Ma & Nikolaos V. Sahinidis & Sreekanth Rajagopalan & Satyajith Amaran & Scott J Bury - 293-321 Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
by Jacek Gondzio & E. Alper Yıldırım - 323-350 A variational approach to the alternating projections method
by Carlo Alberto Bernardi & Enrico Miglierina - 351-365 Optimality conditions based on the Fréchet second-order subdifferential
by D. T. V. An & N. D. Yen - 367-389 A branch-and-bound algorithm for solving max-k-cut problem
by Cheng Lu & Zhibin Deng - 391-433 Scenario-based cuts for structured two-stage stochastic and distributionally robust p-order conic mixed integer programs
by Manish Bansal & Yingqiu Zhang - 435-468 Copula theory approach to stochastic geometric programming
by Rashed Khanjani-Shiraz & Salman Khodayifar & Panos M. Pardalos - 469-491 Model risk in mean-variance portfolio selection: an analytic solution to the worst-case approach
by Roberto Baviera & Giulia Bianchi - 493-528 Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
by Ken Kobayashi & Yuichi Takano & Kazuhide Nakata - 529-557 Detecting and solving aircraft conflicts using bilevel programming
by Martina Cerulli & Claudia D’Ambrosio & Leo Liberti & Mercedes Pelegrín
September 2021, Volume 81, Issue 1
- 1-2 Preface to the special issue of JOGO on the occasion of the 40th anniversary of the Group for Research in Decision Analysis (GERAD)
by Daniel Aloise & Gilles Caporossi & Sébastien Digabel - 3-22 Learning chordal extensions
by Defeng Liu & Andrea Lodi & Mathieu Tanneau - 23-83 The conditional p-dispersion problem
by Marilène Cherkesly & Claudio Contardo - 85-108 Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice
by Ruobing Shen & Bo Tang & Leo Liberti & Claudia D’Ambrosio & Stéphane Canu - 109-152 Advances in verification of ReLU neural networks
by Ansgar Rössig & Milena Petkovic - 153-178 Resolving sets and integer programs for recommender systems
by Alain Hertz & Tsvi Kuflik & Noa Tuval - 179-202 An outer–inner linearization method for non-convex and nondifferentiable composite regularization problems
by Minh Pham & Xiaodong Lin & Andrzej Ruszczyński & Yu Du - 203-231 Surrogate optimization of deep neural networks for groundwater predictions
by Juliane Müller & Jangho Park & Reetik Sahu & Charuleka Varadharajan & Bhavna Arora & Boris Faybishenko & Deborah Agarwal - 233-260 Optimal decision trees for categorical data via integer programming
by Oktay Günlük & Jayant Kalagnanam & Minhan Li & Matt Menickelly & Katya Scheinberg - 261-268 Using symbolic calculations to determine largest small polygons
by Charles Audet & Pierre Hansen & Dragutin Svrtan
August 2021, Volume 80, Issue 4
- 731-756 Linearization of McCormick relaxations and hybridization with the auxiliary variable method
by Jaromił Najman & Dominik Bongartz & Alexander Mitsos - 757-778 Convex hull representations for bounded products of variables
by Kurt M. Anstreicher & Samuel Burer & Kyungchan Park - 779-804 On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
by B. G.-Tóth & L. G. Casado & E. M. T. Hendrix & F. Messine - 805-840 Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization
by Andriy Shapoval & Eva K. Lee - 841-864 Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems
by Zehui Jia & Jieru Huang & Xingju Cai - 865-886 MVMOO: Mixed variable multi-objective optimisation
by Jamie A. Manson & Thomas W. Chamberlain & Richard A. Bourne - 887-920 Optimizing generalized kernels of polygons
by Alejandra Martinez-Moraian & David Orden & Leonidas Palios & Carlos Seara & Paweł Żyliński - 921-943 Unique solvability of weakly homogeneous generalized variational inequalities
by Xueli Bai & Mengmeng Zheng & Zheng-Hai Huang - 945-963 Dynamical system for solving bilevel variational inequalities
by Pham Ky Anh & Trinh Ngoc Hai - 965-989 Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system
by Bismark Singh & Bernard Knueven
July 2021, Volume 80, Issue 3
- 507-522 An interval branch and bound method for global Robust optimization
by Emilio Carrizosa & Frédéric Messine - 523-550 Partially distributed outer approximation
by Alexander Murray & Timm Faulwasser & Veit Hagenmeyer & Mario E. Villanueva & Boris Houska - 551-594 Near optimal minimal convex hulls of disks
by Josef Kallrath & Joonghyun Ryu & Chanyoung Song & Mokwon Lee & Deok-Soo Kim - 595-616 Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint
by Zhenning Zhang & Donglei Du & Yanjun Jiang & Chenchen Wu - 617-634 Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems
by Janusz Miroforidis - 635-659 Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets
by Pin-Bo Chen & Gui-Hua Lin & Xide Zhu & Fusheng Bai - 661-677 Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
by Yingli Ran & Xiaohui Huang & Zhao Zhang & Ding-Zhu Du - 679-710 Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
by Michael Khachay & Yuri Ogorodnikov & Daniel Khachay - 711-728 An optimization approach for winner determination problem considering transportation cost discounts
by Fang Yang & Yao-Huei Huang - 729-730 Review on the monograph Deterministic Global Optimization: An Introduction to the Diagonal Approach, Springer, 2017, written by Yaroslav D. Sergeyev and Dmitri E. Kvasov
by Timoleon Kipouros
June 2021, Volume 80, Issue 2
- 231-248 Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
by Sourour Elloumi & Amélie Lambert & Arnaud Lazare - 249-286 Convexification techniques for linear complementarity constraints
by Trang T. Nguyen & Jean-Philippe P. Richard & Mohit Tawarmalani - 287-305 Convexification of bilinear forms through non-symmetric lifting
by Marcia Fampa & Jon Lee - 307-340 Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
by Frauke Liers & Alexander Martin & Maximilian Merkert & Nick Mertens & Dennis Michaels - 341-356 Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
by Zhuoyi Xu & Yong Xia & Jiulin Wang - 357-385 On tackling reverse convex constraints for non-overlapping of unequal circles
by Akang Wang & Chrysanthos E. Gounaris - 387-414 A robust method based on LOVO functions for solving least squares problems
by E. V. Castelani & R. Lopes & W. V. I. Shirabayashi & F. N. C. Sobral - 415-438 A smoothing quasi-Newton method for solving general second-order cone complementarity problems
by Jingyong Tang & Jinchuan Zhou - 439-477 A method for convex black-box integer global optimization
by Jeffrey Larson & Sven Leyffer & Prashant Palkar & Stefan M. Wild - 479-505 Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning
by Hideaki Iiduka
May 2021, Volume 80, Issue 1
- 1-2 Preface of the special issue on global multiobjective optimization
by Kaisa Miettinen & Serpil Sayin - 3-29 Inverse multiobjective optimization: Inferring decision criteria from data
by Bennet Gebken & Sebastian Peitz - 31-61 Nonconvex constrained optimization by a filtering branch and bound
by Gabriele Eichfelder & Kathrin Klamroth & Julia Niebling - 63-86 Proximity measures based on KKT points for constrained multi-objective optimization
by Gabriele Eichfelder & Leo Warnow - 87-115 One-exact approximate Pareto sets
by Arne Herzel & Cristina Bazgan & Stefan Ruzika & Clemens Thielen & Daniel Vanderpooten - 117-138 Multi-objective convex polynomial optimization and semidefinite programming relaxations
by Jae Hyoung Lee & Nithirat Sisarat & Liguo Jiao - 139-160 Duality in nonconvex vector optimization
by Refail Kasimbeyli & Masoud Karimi - 161-175 Essential stability in unified vector optimization
by Shiva Kapoor & C. S. Lalitha - 177-193 Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization
by Elena Constantin - 195-227 A general branch-and-bound framework for continuous global multiobjective optimization
by Gabriele Eichfelder & Peter Kirst & Laura Meng & Oliver Stein - 229-229 Correction to: A general branch-and-bound framework for continuous global multiobjective optimization
by Gabriele Eichfelder & Peter Kirst & Laura Meng & Oliver Stein
April 2021, Volume 79, Issue 4
- 779-811 Data-driven distributionally robust chance-constrained optimization with Wasserstein metric
by Ran Ji & Miguel A. Lejeune - 813-836 General splitting methods with linearization for the split feasibility problem
by Qiao-Li Dong & Songnian He & Michael Th. Rassias - 837-852 An optimization approach to solving the split feasibility problem in Hilbert spaces
by Simeon Reich & Truong Minh Tuyen & Mai Thi Ngoc Ha - 853-883 Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
by Yaohua Hu & Chong Li & Kaiwen Meng & Xiaoqi Yang - 885-904 Robust constrained best approximation with nonconvex constraints
by H. Mohebi & S. Salkhordeh - 905-925 On robustness for set-valued optimization problems
by Kuntal Som & V. Vetrivel - 927-940 Gaddum’s test for symmetric cones
by Michael Orlitzky - 941-957 The finite intersection property for equilibrium problems
by John Cotrina & Anton Svensson - 959-987 Maximum shortest path interdiction problem by upgrading edges on trees under weighted $$l_1$$ l 1 norm
by Qiao Zhang & Xiucui Guan & Panos M. Pardalos - 989-1006 The EMS vehicle patient transportation problem during a demand surge
by Farshad Majzoubi & Lihui Bai & Sunderesh S. Heragu
March 2021, Volume 79, Issue 3
- 521-566 The DIRECT algorithm: 25 years Later
by Donald R. Jones & Joaquim R. R. A. Martins - 567-591 Design of IMEXRK time integration schemes via Delaunay-based derivative-free optimization with nonconvex constraints and grid-based acceleration
by Ryan Alimo & Daniele Cavaglieri & Pooriya Beyhaghi & Thomas R. Bewley - 593-615 A Galerkin approach to optimization in the space of convex and compact subsets of $${\mathbb {R}}^d$$ R d
by Janosch Rieger - 617-644 Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
by Zhongming Wu & Chongshou Li & Min Li & Andrew Lim - 645-667 Optimal correction of the absolute value equations
by Hossein Moosaei & Saeed Ketabchi & Milan Hladík - 669-686 A combination of RANSAC and DBSCAN methods for solving the multiple geometrical object detection problem
by Rudolf Scitovski & Snježana Majstorović & Kristian Sabo - 687-714 Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
by Carlos Alegría & David Orden & Carlos Seara & Jorge Urrutia - 715-732 A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
by Lulu Cheng & Xinzhen Zhang & Guyan Ni