Printed from https://ideas.repec.org/s/spr/jglopt.html
Content
September 2024, Volume 90, Issue 1
- 1-25 Gradient projection method on the sphere, complementarity problems and copositivity
by Orizon Pereira Ferreira & Yingchao Gao & Sándor Zoltán Németh & Petra Renáta Rigó - 27-51 Relaxations and cutting planes for linear programs with complementarity constraints
by Alberto Pia & Jeff Linderoth & Haoran Zhu - 53-72 Optimality conditions and sensitivity analysis in parametric nonconvex minimax programming
by D. T. V. An & N. H. Hung & D. T. Ngoan & N. V. Tuyen - 73-92 An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
by Jiefei He & Huiling Zhang & Zi Xu - 93-125 Subspace Newton method for sparse group $$\ell _0$$ ℓ 0 optimization problem
by Shichen Liao & Congying Han & Tiande Guo & Bonan Li - 127-151 A new optimization approach to solving split equality problems in Hilbert spaces
by Simeon Reich & Truong Minh Tuyen & Nguyen Song Ha - 153-215 Distributed accelerated gradient methods with restart under quadratic growth condition
by Chhavi Sharma & Vishnu Narayanan & P. Balamurugan - 217-241 Characteristic sets and characteristic numbers of matrix two-person games
by D. T. K. Huyen & J.-C. Yao & N. D. Yen - 243-259 Almost optimal manipulation of pairwise comparisons of alternatives
by Jacek Szybowski & Konrad Kułakowski & Sebastian Ernst - 261-291 Social equity in international environmental agreements
by Chiara Donnini & Armando Sacco
August 2024, Volume 89, Issue 4
- 833-861 Modification and improved implementation of the RPD method for computing state relaxations for global dynamic optimization
by Jason Ye & Joseph K. Scott - 863-897 A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
by Hongwei Liu & Ting Wang & Zexian Liu - 899-926 A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization
by Jianghua Yin & Chunming Tang & Jinbao Jian & Qiongxuan Huang - 927-948 An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
by Le Thi Khanh Hien & Dimitri Papadimitriou - 949-974 Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
by Zhou Sheng & Gonglin Yuan - 975-994 Computing the recession cone of a convex upper image via convex projection
by Gabriela Kováčová & Firdevs Ulus - 995-1032 Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering
by Maolin Che & Yimin Wei & Hong Yan - 1033-1067 Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
by Dmitry Gribanov & Ivan Shumilov & Dmitry Malyshev & Nikolai Zolotykh - 1069-1098 Simple proximal-type algorithms for equilibrium problems
by Yonghong Yao & Abubakar Adamu & Yekini Shehu & Jen-Chih Yao - 1099-1119 Nonlinear scalarization in set optimization based on the concept of null set
by Anveksha Moar & Pradeep Kumar Sharma & C. S. Lalitha
July 2024, Volume 89, Issue 3
- 509-558 The appeals of quadratic majorization–minimization
by Marc C. Robini & Lihui Wang & Yuemin Zhu - 559-595 A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization
by Abbas Khademi & Ahmadreza Marandi & Majid Soleimani-damaneh - 597-632 A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
by Hongwei Jiao & Binbin Li & Wenqiang Yang - 633-653 A method for searching for a globally optimal k-partition of higher-dimensional datasets
by Kristian Sabo & Rudolf Scitovski & Šime Ungar & Zoran Tomljanović - 655-685 A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack
by Sabah Bushaj & İ. Esra Büyüktahtakın - 687-722 Regret analysis of an online majorized semi-proximal ADMM for online composite optimization
by Zehao Xiao & Liwei Zhang - 723-744 Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds
by Balendu Bhooshan Upadhyay & Arnav Ghosh & Savin Treanţă - 745-776 Consensus-based optimization for multi-objective problems: a multi-swarm approach
by Kathrin Klamroth & Michael Stiglmayr & Claudia Totzeck - 777-801 Fast deterministic algorithms for non-submodular maximization with strong performance guarantees
by Cheng Lu & Wenguo Yang - 803-832 A performance analysis of Basin hopping compared to established metaheuristics for global optimization
by Marco Baioletti & Valentino Santucci & Marco Tomassini
June 2024, Volume 89, Issue 2
- 259-276 The exact projective penalty method for constrained optimization
by Vladimir Norkin - 277-302 Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
by Jing-jing Wang & Li-ping Tang & Xin-min Yang - 303-325 First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis
by Jiawei Chen & Huasheng Su & Xiaoqing Ou & Yibing Lv - 327-354 A Bregman inertial forward-reflected-backward method for nonconvex minimization
by Xianfu Wang & Ziyuan Wang - 355-378 Generalized derivatives of optimal-value functions with parameterized convex programs embedded
by Yingkai Song & Paul I. Barton - 379-413 Gaining or losing perspective for convex multivariate functions on a simplex
by Luze Xu & Jon Lee - 415-434 Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
by Daniela Lera & Maria Chiara Nasso & Mikhail Posypkin & Yaroslav D. Sergeyev - 435-455 Single-lot, lot-streaming problem for a 1 + m hybrid flow shop
by Sanchit Singh & Subhash C. Sarin & Ming Cheng - 457-476 Interval constraint programming for globally solving catalog-based categorical optimization
by Charlie Vanaret - 477-507 A strong P-formulation for global optimization of industrial water-using and treatment networks
by Xin Cheng & Xiang Li
May 2024, Volume 89, Issue 1
- 1-31 On asymptotic convergence rate of random search
by Dawid Tarłowski - 33-55 A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis
by Eyal Cohen & D. Russell Luke & Titus Pinta & Shoham Sabach & Marc Teboulle - 57-71 Strict feasibility for the polynomial complementarity problem
by Xue-liu Li & Guo-ji Tang - 73-92 Existence of solutions to $$\Gamma $$ Γ -robust counterparts of gap function formulations of uncertain LCPs with ellipsoidal uncertainty sets
by Lulin Tan & Wei Hong Yang & Jinbiao Pan - 93-115 A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization
by Fusheng Bai & Dongchi Zou & Yutao Wei - 117-142 Discrete approximation for two-stage stochastic variational inequalities
by Jie Jiang & Hailin Sun - 143-170 Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities
by Zhen-Ping Yang & Yong Zhao & Gui-Hua Lin - 171-196 On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective
by E. L. Dias Júnior & P. J. S. Santos & A. Soubeyran & J. C. O. Souza - 197-221 Extragradient-type methods with $$\mathcal {O}\left( 1/k\right) $$ O 1 / k last-iterate convergence rates for co-hypomonotone inclusions
by Quoc Tran-Dinh - 223-257 Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies
by Dominique Barth & Thierry Mautor & Dimitri Watel & Marc-Antoine Weisser
April 2024, Volume 88, Issue 4
- 803-829 Separating disconnected quadratic level sets by other quadratic level sets
by Huu-Quang Nguyen & Ya-Chi Chu & Ruey-Lin Sheu - 831-870 Approximation hierarchies for copositive cone over symmetric cone and their comparison
by Mitsuhiro Nishijima & Kazuhide Nakata - 871-900 Globalized distributionally robust optimization based on samples
by Yueyao Li & Wenxun Xing - 901-926 Robust second order cone conditions and duality for multiobjective problems under uncertainty data
by Cao Thanh Tinh & Thai Doan Chuong - 927-945 Reference-point-based branch and bound algorithm for multiobjective optimization
by Wei-tian Wu & Xin-min Yang - 947-978 Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach
by Donald R. Jones & Alberto Lovison - 979-998 Optimality and error bound for set optimization with application to uncertain multi-objective programming
by Wenyan Han & Guolin Yu - 999-1034 Multistage robust optimization for the day-ahead scheduling of hybrid thermal-hydro-wind-solar systems
by Zhiming Zhong & Neng Fan & Lei Wu - 1035-1050 Small polygons with large area
by Christian Bingane & Michael J. Mossinghoff - 1051-1076 Proximal gradient algorithm with trust region scheme on Riemannian manifold
by Shimin Zhao & Tao Yan & Yuanguo Zhu
March 2024, Volume 88, Issue 3
- 531-532 Preface
by Ilias Kotsireas & Panos Pardalos & Julius Žilinskas - 533-590 Open issues and recent advances in DC programming and DCA
by Hoai An Le Thi & Tao Pham Dinh - 591-651 On $$\Delta $$ Δ -modular integer linear problems in the canonical form and equivalent problems
by Dmitry Gribanov & Ivan Shumilov & Dmitry Malyshev & Panos Pardalos - 653-683 Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem
by Alla Kammerdiner & Alexander Semenov & Eduardo L. Pasiliao - 685-705 Parallel algorithm portfolios with adaptive resource allocation strategy
by Konstantinos E. Parsopoulos & Vasileios A. Tatsis & Ilias S. Kotsireas & Panos M. Pardalos - 707-722 Numerical methods using two different approximations of space-filling curves for black-box global optimization
by Yaroslav D. Sergeyev & Maria Chiara Nasso & Daniela Lera - 723-753 An empirical study of various candidate selection and partitioning techniques in the DIRECT framework
by Linas Stripinis & Remigijus Paulavičius - 755-776 On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
by Xiangkai Sun & Jiayi Huang & Kok Lay Teo - 777-802 Scalable Bayesian optimization with generalized product of experts
by Saulius Tautvaišas & Julius Žilinskas
February 2024, Volume 88, Issue 2
- 285-326 A bundle-type method for nonsmooth DC programs
by Christian Kanzow & Tanja Neder - 327-357 A cooperative approach to efficient global optimization
by Dawei Zhan & Jintao Wu & Huanlai Xing & Tianrui Li - 359-375 Relaxed method for optimization problems with cardinality constraints
by Yan-Chao Liang & Gui-Hua Lin - 377-394 Constraint generation approaches for submodular function maximization leveraging graph properties
by Eszter Csókás & Tamás Vinkó - 395-407 Intersecting ellipses induced by a max-sum matching
by Polina Barabanshchikova & Alexandr Polyanskii - 409-429 Hausdorff distance between convex semialgebraic sets
by Wenjie Zhao & Guangming Zhou - 431-460 Directional shadow price in linearly constrained nonconvex optimization models
by Tao Jie & Gao Yan - 461-483 A utopia point method-based robust vector polynomial optimization scheme
by Tianyi Han & Liguo Jiao & Jae Hyoung Lee & Junping Yin - 485-508 A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
by Xian Zhang & Dingtao Peng & Yanyan Su - 509-530 Time-dependent elliptic quasi-variational-hemivariational inequalities: well-posedness and application
by Tie-jun Jiang & Dong-ling Cai & Yi-bin Xiao & Stanisław Migórski
January 2024, Volume 88, Issue 1
- 1-26 Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms
by Jack Noonan & Anatoly Zhigljavsky - 27-51 An oracle-based framework for robust combinatorial optimization
by Enrico Bettiol & Christoph Buchheim & Marianna De Santis & Francesco Rinaldi - 53-77 Geometric multidimensional scaling: efficient approach for data dimensionality reduction
by Gintautas Dzemyda & Martynas Sabaliauskas - 79-114 Low-rank matrix estimation via nonconvex optimization methods in multi-response errors-in-variables regression
by Xin Li & Dongya Wu - 115-137 A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem
by Cheng Lu & Jitao Ma & Zhibin Deng & Wenxun Xing - 139-169 Lipschitz-inspired HALRECT algorithm for derivative-free global optimization
by Linas Stripinis & Remigijus Paulavičius - 171-197 A new partition method for DIRECT-type algorithm based on minimax design
by Kai Jia & Xiaojun Duan & Zhengming Wang & Taihe Yi & Liang Yan & Xuan Chen - 199-232 Finding groups with maximum betweenness centrality via integer programming with random path sampling
by Tomás Lagos & Oleg A. Prokopyev & Alexander Veremyev - 233-252 Dispersing facilities on planar segment and circle amidst repulsion
by Vishwanath R. Singireddy & Manjanna Basappa - 253-283 Subdifferentials of optimal value functions under metric qualification conditions
by Vu Thi Huong & Duong Thi Viet An & Hong-Kun Xu
November 2023, Volume 87, Issue 2
- 325-327 Preface: special issue of MOA 2020
by Ya-Feng Liu & Zi Xu & Pavlo A. Krokhmal & Jiming Peng - 329-346 Fitting feature-dependent Markov chains
by Shane Barratt & Stephen Boyd - 347-371 Solution sets of three sparse optimization problems for multivariate regression
by Xiaojun Chen & Lili Pan & Naihua Xiu - 373-403 Randomized algorithms for the computation of multilinear rank- $$(\mu _1,\mu _2,\mu _3)$$ ( μ 1 , μ 2 , μ 3 ) approximations
by Maolin Che & Yimin Wei & Yanwei Xu - 405-422 A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
by Wenjie Wang & Haibin Chen & Yiju Wang & Guanglu Zhou - 423-446 Improved variance reduction extragradient method with line search for stochastic variational inequalities
by Ting Li & Xingju Cai & Yongzhong Song & Yumin Ma - 447-479 An Entropy-Regularized ADMM For Binary Quadratic Programming
by Haoming Liu & Kangkang Deng & Haoyang Liu & Zaiwen Wen - 481-501 Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
by Juan Liu & Xian-Jun Long & Xiang-Kai Sun - 503-532 A new global algorithm for factor-risk-constrained mean-variance portfolio selection
by Huixian Wu & Hezhi Luo & Xianye Zhang & Jianzhen Liu - 533-550 An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization
by Rui Liu & Deren Han & Yong Xia - 551-580 Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
by Jingjing Shen & Ziqi Wang & Zi Xu - 581-602 A golden ratio proximal alternating direction method of multipliers for separable convex optimization
by Hongmei Chen & Guoyong Gu & Junfeng Yang - 603-618 Approximation algorithms for the individually fair k-center with outliers
by Lu Han & Dachuan Xu & Yicheng Xu & Ping Yang - 619-639 A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery
by Haitao Che & Yaru Zhuang & Yiju Wang & Haibin Chen - 641-677 A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations
by Jiayun Rao & Na Huang - 679-707 Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization
by Xiaojiao Tong & Manlan Li & Hailin Sun - 709-740 Zeroth-order algorithms for nonconvex–strongly-concave minimax problems with improved complexities
by Zhongruo Wang & Krishnakumar Balasubramanian & Shiqian Ma & Meisam Razaviyayn - 741-758 Quaternion matrix decomposition and its theoretical implications
by Chang He & Bo Jiang & Xihua Zhu - 759-781 Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets
by Zai-Yun Peng & Xue-Jing Chen & Yun-Bin Zhao & Xiao-Bing Li - 783-805 Distributionally robust mean-absolute deviation portfolio optimization using wasserstein metric
by Dali Chen & Yuwei Wu & Jingquan Li & Xiaohui Ding & Caihua Chen - 807-830 Multiobjective optimization with least constraint violation: optimality conditions and exact penalization
by Jiawei Chen & Yu-Hong Dai - 831-855 A facial reduction approach for the single source localization problem
by He Shi & Qingna Li - 857-876 A note on the SDP relaxation of the minimum cut problem
by Hao Hu & Xinxin Li & Jiageng Wu - 877-915 Data-trading coordination with government subsidy
by Kui Jing & Xin Liu & Fengmin Xu & Donglei Du - 917-937 A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis
by Jian Sun & Zan-Bo Zhang & Yannan Chen & Deren Han & Donglei Du & Xiaoyan Zhang - 939-964 Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
by Xin Yang & Lingling Xu - 965-988 An inexact primal–dual method with correction step for a saddle point problem in image debluring
by Changjie Fang & Liliang Hu & Shenglan Chen - 989-1008 Learning-augmented algorithms for online subset sum
by Chenyang Xu & Guochuan Zhang - 1009-1025 A mini-batch stochastic conjugate gradient algorithm with variance reduction
by Caixia Kou & Han Yang - 1027-1053 IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
by Rui-Jin Zhang & Xin-Wei Liu & Yu-Hong Dai
September 2023, Volume 87, Issue 1
- 1-30 Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities
by Anna Nagurney & Dana Hassani & Oleg Nivievskyi & Pavlo Martyshev - 31-55 Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise
by Zelda B. Zabinsky & David D. Linz - 57-95 Extended McCormick relaxation rules for handling empty arguments representing infeasibility
by Jason Ye & Joseph K. Scott - 97-132 Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
by Moritz Link & Stefan Volkwein - 133-189 Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
by Jan Pablo Burgard & Carina Moreira Costa & Christopher Hojny & Thomas Kleinert & Martin Schmidt - 191-219 An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
by Huixian Wu & Hezhi Luo & Xianye Zhang & Haiqiang Qi - 221-254 Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization
by Markus Gabl - 255-275 New semidefinite relaxations for a class of complex quadratic programming problems
by Yingzhe Xu & Cheng Lu & Zhibin Deng & Ya-Feng Liu - 277-300 An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
by Xue Gao & Xingju Cai & Xiangfeng Wang & Deren Han - 301-323 On solving bi-objective constrained minimum spanning tree problems
by Iago A. Carvalho & Amadeu A. Coco
August 2023, Volume 86, Issue 4
- 821-844 An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems
by Zhili Ge & Zhongming Wu & Xin Zhang & Qin Ni - 845-865 Semistrictly and neatly quasiconvex programming using lower global subdifferentials
by A. Kabgani & F. Lara - 867-883 Structured tensor tuples to polynomial complementarity problems
by Tong-tong Shang & Guo-ji Tang - 885-903 An average-compress algorithm for the sample mean problem under dynamic time warping
by Brijnesh Jain & Vincent Froese & David Schultz - 905-930 A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
by Feng Guo & Liguo Jiao - 931-952 On the study of multistage stochastic vector quasi-variational problems
by Elena Molho & Domenico Scopelliti - 953-988 Mixed polynomial variational inequalities
by Tong-tong Shang & Guo-ji Tang - 989-1003 Noncoercive and noncontinuous equilibrium problems: existence theorem in infinite-dimensional spaces
by F. Fakhar & H. R. Hajisharifi & Z. Soltani - 1005-1023 Second-order characterization of convex mappings in Banach spaces and its applications
by Mohammad Taghi Nadi & Jafar Zafarani - 1025-1061 Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods
by Markus Friedemann & Felix Harder & Gerd Wachsmuth
July 2023, Volume 86, Issue 3
- 545-572 General convex relaxations of implicit functions and inverse functions
by Huiyi Cao & Kamil A. Khan - 573-588 Subdomain separability in global optimization
by Jens Deussen & Uwe Naumann - 589-620 A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
by Liping Pang & Xiaoliang Wang & Fanyun Meng - 621-636 Approximate Douglas–Rachford algorithm for two-sets convex feasibility problems
by R. Díaz Millán & O. P. Ferreira & J. Ugon - 637-670 Distributed primal outer approximation algorithm for sparse convex programming with separable structures
by Alireza Olama & Eduardo Camponogara & Paulo R. C. Mendes - 671-691 Exact SDP relaxations for quadratic programs with bipartite graph structures
by Godai Azuma & Mituhiro Fukuda & Sunyoung Kim & Makoto Yamashita - 693-711 A robust multi-objective Bayesian optimization framework considering input uncertainty
by Jixiang Qing & Ivo Couckuyt & Tom Dhaene - 713-739 A robust investment-consumption optimization problem in a switching regime interest rate setting
by Bogdan Iftimie - 741-780 A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management
by Gabriella Colajanni & Patrizia Daniele & Anna Nagurney & Ladimer S. Nagurney & Daniele Sciacca - 781-820 The interpolating element-free Galerkin method for the p-Laplace double obstacle mixed complementarity problem
by Rui Ding & Chaoren Ding & Quan Shen
June 2023, Volume 86, Issue 2
- 285-301 KKT-based primal-dual exactness conditions for the Shor relaxation
by M. Locatelli - 303-321 Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
by Peiping Shen & Dianxiao Wu & Kaimin Wang - 323-353 A non-convex piecewise quadratic approximation of $$\ell _{0}$$ ℓ 0 regularization: theory and accelerated algorithm
by Qian Li & Wei Zhang & Yanqin Bai & Guoqiang Wang - 355-391 Efficient enumeration of the optimal solutions to the correlation clustering problem
by Nejat Arınık & Rosa Figueiredo & Vincent Labatut - 393-415 Approximating biobjective minimization problems using general ordering cones
by Arne Herzel & Stephan Helfrich & Stefan Ruzika & Clemens Thielen - 417-440 Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
by Stephan Helfrich & Tyler Perini & Pascal Halffmann & Natashia Boland & Stefan Ruzika - 441-466 Faster distance-based representative skyline and k-center along pareto front in the plane
by Sergio Cabello - 467-494 A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems
by Sanath Kahagalage & Hasan Hüseyin Turan & Fatemeh Jalalvand & Sondoss El Sawah - 495-520 A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors
by Zheng-Hai Huang & Yu-Fan Li & Yong Wang - 521-543 A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
by Andreas Ernst & Lars Grüne & Janosch Rieger
May 2023, Volume 86, Issue 1
- 1-23 TREGO: a trust-region framework for efficient global optimization
by Youssef Diouane & Victor Picheny & Rodolophe Le Riche & Alexandre Scotto Di Perrotolo - 25-36 Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces
by Heinz H. Bauschke & Manish Krishan Lal & Xianfu Wang - 37-60 Nonconvex sensitivity-based generalized Benders decomposition
by Jia-Jiang Lin & Feng Xu & Xiong-Lin Luo - 61-92 Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
by Bo Zhang & YueLin Gao & Xia Liu & XiaoLi Huang - 93-122 Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials
by Pham Duy Khanh & Boris S. Mordukhovich & Vo Thanh Phat & Dat Ba Tran - 123-140 Extension of forward-reflected-backward method to non-convex mixed variational inequalities
by Chinedu Izuchukwu & Yekini Shehu & Chibueze C. Okeke - 141-161 Some saddle-point theorems for vector-valued functions
by Nguyen Xuan Hai & Nguyen Hong Quan & Vo Viet Tri - 163-203 Global linear convergence of evolution strategies with recombination on scaling-invariant functions
by Cheikh Toure & Anne Auger & Nikolaus Hansen - 205-249 Lifting for the integer knapsack cover polyhedron
by Wei-Kun Chen & Liang Chen & Yu-Hong Dai - 251-284 The restricted inverse optimal value problem on shortest path under $$l_1$$ l 1 norm on trees
by Qiao Zhang & Xiucui Guan & Junhua Jia & Xinqiang Qian & Panos M. Pardalos
April 2023, Volume 85, Issue 4
- 789-819 On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
by Andreas Bärmann & Robert Burlacu & Lukas Hager & Thomas Kleinert - 821-846 Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes
by Fan Jiang & Zhiyuan Zhang & Hongjin He - 847-866 Primal-dual splittings as fixed point iterations in the range of linear operators
by Luis Briceño-Arias & Fernando Roldán - 867-889 Calmness of partial perturbation to composite rank constraint systems and its applications
by Yitian Qian & Shaohua Pan & Yulan Liu - 891-915 A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems
by Li-Ping Pang & Fan-Yun Meng & Jian-Song Yang - 917-940 Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions
by Amos Uderzo - 941-968 An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds
by João S. Andrade & Jurandir de O. Lopes & João Carlos de O. Souza - 969-1002 Weak and strong convergence of generalized proximal point algorithms with relaxed parameters
by Hui Ouyang - 1003-1036 Separating bichromatic point sets in the plane by restricted orientation convex hulls
by Carlos Alegría & David Orden & Carlos Seara & Jorge Urrutia - 1037-1063 Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
by Phan Thanh An & Hoang Xuan Phu
March 2023, Volume 85, Issue 3
- 541-568 Computational advances in polynomial optimization: RAPOSa, a freely available global solver
by Brais González-Rodríguez & Joaquín Ossorio-Castillo & Julio González-Díaz & Ángel M. González-Rueda & David R. Penas & Diego Rodríguez-Martínez - 569-594 Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
by Matthew E. Wilhelm & Chenyu Wang & Matthew D. Stuber - 595-613 New bounds for nonconvex quadratically constrained quadratic programming
by Moslem Zamani - 615-635 Relaxed-inertial proximal point type algorithms for quasiconvex minimization
by S.-M. Grad & F. Lara & R. T. Marcavillaca - 637-661 EFIX: Exact fixed point methods for distributed optimization
by Dušan Jakovetić & Nataša Krejić & Nataša Krklec Jerinkić - 663-685 Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
by Tran Van Su - 687-707 Directional derivatives and subdifferentials for set-valued maps applied to set optimization
by Marius Durea & Radu Strugariu - 709-741 On the structure of regularization paths for piecewise differentiable regularization terms
by Bennet Gebken & Katharina Bieker & Sebastian Peitz - 743-756 Calabi-Polyak convexity theorem, Yuan’s lemma and S-lemma: extensions and applications
by Mengmeng Song & Yong Xia - 757-788 Comparing reference point based interactive multiobjective optimization methods without a human decision maker
by Lu Chen & Kaisa Miettinen & Bin Xin & Vesa Ojalehto
February 2023, Volume 85, Issue 2
- 257-282 Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness
by Hung Yi Lee & Charles Hernandez & Hongcheng Liu - 283-313 A novel approach for solving multi-parametric problems with nonlinear constraints
by Addis Belete Zewde & Semu Mitiku Kassa - 315-349 Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
by Xin Li & Yaohua Hu & Chong Li & Xiaoqi Yang & Tianzi Jiang - 351-375 Multi-instance learning by maximizing the area under receiver operating characteristic curve
by I. Edhem Sakarya & O. Erhun Kundakcioglu - 377-420 Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring
by Branislav Ivanov & Gradimir V. Milovanović & Predrag S. Stanimirović - 421-439 An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
by Zhengyong Zhou & Xiaoyang Dai - 441-460 Aubin property for solution set in multi-objective programming
by Morteza Rahimi & Majid Soleimani-damaneh - 461-485 Vertex quickest 1-center location problem on trees and its inverse problem under weighted $$l_\infty $$ l ∞ norm
by Xinqiang Qian & Xiucui Guan & Junhua Jia & Qiao Zhang & Panos M. Pardalos - 487-510 One-Step iterative method for bilevel equilibrium problem in Hilbert space
by Dang Hieu & Pham Kim Quy - 511-539 Global well-posedness of set-valued optimization with application to uncertain problems
by Kuntal Som & V. Vetrivel