Printed from https://ideas.repec.org/s/spr/jglopt.html
Content
April 2026, Volume 94, Issue 4
- 891-918 Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
by E. Alper Yıldırım - 919-949 A Relax-Fix-and-Exclude algorithm for an MINLP problem with multilinear interpolations
by Bruno M. Pacheco & Pedro M. Antunes & Eduardo Camponogara & Laio O. Seman & Vinícius R. Rosa & Bruno F. Vieira & Cesar Longhi - 951-996 Parabolic approximation & relaxation for MINLP
by Adrian Göss & Robert Burlacu & Alexander Martin - 997-1003 Characterizations of Strongly Quasiconvex Functions
by Nicolas Hadjisavvas & Felipe Lara - 1005-1051 Stochastic ADMM with variance-reduced recursive momentum and its accelerated variant for nonconvex nonsmooth optimization
by Feiyu Long & Congying Han & Tiande Guo & Shichen Liao - 1053-1080 Quasi-Newton method with subspace gradients
by Taisei Miyaishi & Ryota Nozawa & Pierre-Louis Poirion & Akiko Takeda - 1081-1097 A new relaxed projection method for solving the split feasibility problem with multiple output sets
by Wanrong Zhan & Hai Yu & Fenghui Wang - 1099-1135 Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem
by Santanu S. Dey & Dahye Han & Yang Wang - 1137-1166 Outer approximation scheme for weakly convex constrained optimization problems
by Ewa M. Bednarczuk & Giovanni Bruccola & Jean-Christophe Pesquet & Krzysztof Rutkowski
March 2026, Volume 94, Issue 3
- 593-634 Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions
by Suryateja Ravutla & Fani Boukouvala - 635-666 An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants
by Danny D’Agostino - 667-698 Quadratic convex reformulations for multiObjective binary quadratic programming
by Marianna De Santis & Lucas Létocart & Yue Zhang - 699-728 SPLD polynomial optimization and bounded degree SOS hierarchies
by Liguo Jiao & Jae Hyoung Lee & Nguyen Bui Nguyen Thao - 729-753 An optimization approach for transformed low tubal rank of third-order tensors
by Jinjie Liu & Chen Ling & Erbo Zhao & Xinmin Yang - 755-782 A Bregman ADMM for Robust Fused Lasso Estimation with Doubly Nonconvex Regularizers
by Yibao Fan & Zheng-Fen Jin & Youlin Shang & Deren Han - 783-807 A randomized algorithm for model-based sparse signal recovery
by Huiyuan Yu & Maggie Cheng & Yingdong Lu - 809-844 Sparse Projection onto Semi-Symmetric Sets with Applications to Sparse Optimization
by Jinglai Shen & Saeed Damadi - 845-872 On relation between bilevel programming problems and variational inequalities on hadamard manifolds with application to toll optimization problem
by B. B. Upadhyay & I. M. Stancu-Minasian & Priyanka Mishra & Subham Poddar - 873-890 An effective branch and bound algorithm for generalized risk parity portfolio optimization
by Jing Zhou & Lei Zhang & Wenxun Xing
February 2026, Volume 94, Issue 2
- 309-310 Preface to the special issue on the $$8^\textrm{th}$$ 8 th world congress on global optimization
by Panos M. Pardalos - 311-345 A bi-level programming problem of medicine procurement and production optimization
by Wenjuan Fan & Jingwei Zhang & Kaining Shao & Shaowen Lan & Shuwan Zhu - 347-376 The limitation of neural nets for approximation and optimization
by T. Giovannelli & O. Sohab & L. N. Vicente - 377-397 Parallel machine scheduling with position-dependent processing times and deteriorating maintenance activities
by Chaoming Hu & Rui Zheng & Shaojun Lu & Xinbao Liu - 399-425 Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs
by Amélie Lambert & Daniel Porumbel - 427-457 Hybrid decomposition and deep learning approach for data-driven FOREX forecasting optimization
by Michail G. Papatsimpas & Konstantinos E. Parsopoulos - 459-480 Non-convex optimization problems with linear KKT subsystem
by Mujahid N. Syed - 481-516 A QoS and sustainability-driven two-stage service composition method in cloud manufacturing: combining clustering and bi-objective optimization
by Chunhua Tang & Shuangyao Zhao & Han Su & Binbin Chen - 517-538 Combining gradient information and primitive directions for high-performance Bound-Constrained mixed-integer optimization
by Matteo Lapucci & Giampaolo Liuzzi & Stefano Lucidi & Pierluigi Mansueto - 539-567 Convergence rate of alternating projection method for the intersection of an affine subspace and the second-order cone
by Hiroyuki Ochiai & Yoshiyuki Sekiguchi & Hayato Waki - 569-591 Optimality conditions and solution analysis at infinity for nonsmooth optimization problems
by Nguyen Canh Hung & Nguyen Le Hoang Anh
January 2026, Volume 94, Issue 1
- 1-2 Preface
by Eligius M. T. Hendrix - 3-34 A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions
by Tanmaya Karmarkar & Yves Lucet - 35-63 Norm-induced cuts: outer approximation for Lipschitzian constraint functions
by Adrian Göß & Alexander Martin & Sebastian Pokutta & Kartikey Sharma - 65-93 A kinematic smoothing method for tightening convex relaxations of ordinary differential equations
by Huiyi Cao & Kamil A. Khan - 95-126 Column generation for multistage stochastic mixed-integer nonlinear programs with discrete state variables
by Tushar Rathi & Benjamin P. Riley & Angela Flores-Quiroz & Qi Zhang - 127-174 Distributionally robust fractional optimization of probability of exceedance
by M. A. Lejeune & H. N. Nguyen - 175-201 Voronoi candidates for Bayesian optimization
by Nathan Wycoff & John W. Smith Jr. & Annie S. Booth & Robert B. Gramacy - 203-233 A Diagonal Quasi-Newton Method with Modified BFGS Update for Nonconvex Multiobjective Optimization
by Qingjie Hu & Yanyan Zhang & Ruyun Li & Wanyou Cheng - 235-263 Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods
by Feng-Yi Liao & Lijun Ding & Yang Zheng - 265-289 Monotone submodular maximization under the pairwise capacity constraint
by Yuanyuan Qiang & Bin Liu & Weili Wu - 291-308 Equilibrium problems: existence criteria and applications
by Mircea Balaj
December 2025, Volume 93, Issue 4
- 923-952 Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions
by William R. Strahl & Arvind U. Raghunathan & Nikolaos V. Sahinidis & Chrysanthos E. Gounaris - 953-987 Constructing tight quadratic relaxations for global optimization: II. underestimating difference-of-convex (D.C.) functions
by William R. Strahl & Arvind U. Raghunathan & Nikolaos V. Sahinidis & Chrysanthos E. Gounaris - 989-1026 A surrogate-based adaptive sampling approach for mixed-integer black-box optimization problems
by Emmanouil Karantoumanis & Nikolaos Ploskas - 1027-1051 On existence of solutions to nonconvex minimization problems
by Rohan Rele & Angelia Nedić - 1053-1077 Weak and strong convergence theorems for the mixed split feasibility problem in Hilbert spaces
by Nguyen Song Ha - 1079-1095 Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization
by Fernando García-Castaño & Miguel Ángel Melguizo-Padial - 1097-1120 Absolute value linear programming
by Milan Hladík & David Hartman - 1121-1144 Rank-sparsity decomposition for planted quasi clique recovery
by Sakirudeen A. Abdulsalaam & Montaz Ali - 1145-1176 Minimum flow decomposition in graphs with cycles using integer linear programming
by Fernando H. C. Dias & Lucia Williams & Brendan Mumey & Alexandru I. Tomescu
November 2025, Volume 93, Issue 3
- 605-650 Global optimization algorithm for mixed-integer nonlinear programs with trigonometric functions
by Christopher Montez & Sujeevraja Sanjeevi & Kaarthik Sundar - 651-699 Exact continuous relaxations of $$\ell _0$$ ℓ 0 -regularized criteria with non-quadratic data terms
by Mhamed Essafri & Luca Calatroni & Emmanuel Soubies - 701-731 Sparse sub-gaussian random projections for semidefinite programming relaxations
by Monse Guedes-Ayala & Pierre-Louis Poirion & Lars Schewe & Akiko Takeda - 733-745 Covering a rectangle with 6 circles: a reliable mathematical programming approach
by Sonia Cafieri & Frédéric Messine - 747-776 Optimality and solutions for conic robust multiobjective programs
by Thai Doan Chuong & Xinghuo Yu & Andrew Eberhard & Chaojie Li & Chen Liu - 777-801 Characterization of set order relations and set optimization problems via conic scalarization
by Madhusudan Das & Debdas Ghosh & Jen-Chih Yao & Xiaopeng Zhao - 803-831 Practical proximal primal-dual algorithms for structured saddle point problems
by Yunfei Qu & Hongjin He & Tao Zhang & Deren Han - 833-860 Kurdyka-Łojasiewicz inequality and error bounds of D-Gap functions for nonsmooth and nonmonotone variational inequality problems
by M. H. Li & K. W. Meng & X. Q. Yang - 861-895 Globally optimal strategy against the Hedge algorithm in repeated games
by Xinxiang Guo & Yifen Mu - 897-922 New calculus rules of relative subdifferentials and applications to constrained optimization problems
by Cao Thanh Tinh & Xiaolong Qin & Thai Doan Chuong & Vo Duc Thinh
October 2025, Volume 93, Issue 2
- 335-357 Global solution algorithms for DC programming via polyhedral approximations of convex functions
by Fahaar M. Pirani & Firdevs Ulus - 359-411 Convergence analysis of primal-dual augmented Lagrangian methods and duality theory
by M.V. Dolgopolik - 413-449 Tropical gradient descent
by Roan Talbut & Anthea Monod - 451-470 Point-Based Sufficient Conditions For Sharp Solutions In Nonsmooth Optimization
by Marius DUREA & Elena-Andreea FLOREA & Radu STRUGARIU - 471-487 Optimality conditions for zero-one composite optimization problems
by Guo-Ping Li & Jia-Li Feng & Chao Kan & Wen Song - 489-521 A multi-step inertial extragradient algorithm for nonsmooth and nonconvex composite optimization problems
by Zhixue Wang & Hongjin He - 523-534 Solving a generalization of the p-regularized subproblems by matrix simultaneous diagonalization via congruence
by Van-Bong Nguyen - 535-550 The projected-type method for the extended vertical linear complementarity problem revisited
by Cui-Xia Li & Shi-Liang Wu - 551-569 Revisiting Nesterov’s acceleration via high-resolution differential equations
by Shuo Chen & Bin Shi & Ya-xiang Yuan - 571-603 Publisher Correction: On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power
by Veronika Grimm & Julia Grübel & Martin Schmidt & Alexandra Schwartz & Ann-Kathrin Wiertz & Gregor Zöttl
September 2025, Volume 93, Issue 1
- 1-25 Mixed-Integer Bilevel Optimization with Nonconvex Quadratic Lower-Level Problems: Complexity and a Solution Method
by Immanuel Bomze & Andreas Horländer & Martin Schmidt - 27-61 Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability
by Aron Zingler & Adrian W. Lipow & Alexander Mitsos - 63-85 On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
by Soodeh Habibi & Michal Kočvara & Michael Stingl - 87-112 A new branch-and-bound algorithm for generalized affine multiplicative programming
by Yaping Deng & Peiping Shen - 113-173 A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
by Cristian Daniel Alecsa - 175-213 Scenario consensus algorithms for solving stochastic and dynamic problems
by Felipe Lagos - 215-240 Optimal transport-based distributionally robust optimization with polynomial uncertainty
by Bo Rao & Liu Yang & Jingmin Cai - 241-261 A first-order regularized algorithm with complexity properties for the unconstrained and the convexly constrained low order-value optimization problem
by G. Q. Álvarez & E. G. Birgin & J. M. Martínez - 263-298 Solution methods for partial inverse combinatorial optimization problems in which weights can only be increased
by Eva Ley & Maximilian Merkert - 299-333 A survey of exact and approximation algorithms for linear-parametric optimization problems
by Levin Nemesch & Stefan Ruzika & Clemens Thielen & Alina Wittmann
August 2025, Volume 92, Issue 4
- 837-888 MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching
by Marco Langiu & Manuel Dahmen & Dominik Bongartz & Alexander Mitsos - 889-908 Addressing mixed constraints: an improved framework for black-box optimization
by Raju Chowdhury & Neelesh S. Upadhye - 909-932 Computing local minimizers in polynomial optimization under genericity conditions
by Vu Trung Hieu & Akiko Takeda - 933-950 Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
by Felipe Lara & Nguyen Van Tuyen & Tran Van Nghi - 951-972 Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges
by Xiao Li & Xiucui Guan & Junhua Jia & Panos M. Pardalos - 973-991 An exact approach for the Stackelberg knapsack problem with weight selection
by Yeonghun Lee & Kiho Seo & Seulgi Joung & Sungsoo Park - 993-1020 Covering constants for metric projection operator with applications to stochastic fixed-point problems
by Jinlu Li - 1021-1043 Existence and stability for a class of variational–hemivariational inequalities involving multivalued Brezis pseudomonotone operators
by Shengda Zeng & Xi Chen & Jinxia Cen & Patrick Winkert - 1045-1070 Properties of a generalized oriented distance function and applications to set optimization with a variable structure
by Wenqing Wang & Yihong Xu - 1071-1090 An extragradient algorithm for a lifted reformulation of projected solutions for quasiequilibria
by Giancarlo Bigi & Marco Castellani & Sara Latini
July 2025, Volume 92, Issue 3
- 509-534 Distributionally Robust Optimization with Polynomial Robust Constraints
by Jiawang Nie & Suhan Zhong - 535-568 Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems
by Q. Y. Huang & V. Jeyakumar & G. Li & D. T. K. Huyen - 569-614 Inexact bilevel stochastic gradient methods for constrained and unconstrained lower-level problems
by T. Giovannelli & G. D. Kent & L. N. Vicente - 615-642 Out-of-sample estimation for a branch-and-bound algorithm with growing datasets
by Susanne Sass & Alexander Mitsos & Nikolay I. Nikolov & Angelos Tsoukalas - 643-662 Infinite-dimensional convex cones: internal geometric structure and analytical representation
by Valentin V. Gorokhovik - 663-691 Parallel inexact Levenberg–Marquardt method for nearly-separable nonlinear least squares
by Lidija Fodor & Dušan Jakovetić & Nataša Krejić & Greta Malaspina - 693-711 Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems
by Tanxing Wang & Yaning Jiang & Xingju Cai - 713-736 On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
by Woocheol Choi & Doheon Kim & Seok-Bae Yun - 737-774 A dual adaptive algorithm for matrix optimization with sparse group lasso regularization
by Jinji Yang & Jiang Hu & Chungen Shen - 775-807 Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate
by Kai Chen & Ling Liang & Shaohua Pan - 809-835 A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem
by Lifeng Zhang & Congqin Ge & Yanfeng Zhang & Wenhui Yang & Bingzhen Chen & Zhihong Yuan
June 2025, Volume 92, Issue 2
- 253-278 Gaussian Process regression over discrete probability measures: on the non-stationarity relation between Euclidean and Wasserstein Squared Exponential Kernels
by Antonio Candelieri & Andrea Ponti & Francesco Archetti - 279-293 Quasiconjugate duality and optimality conditions for quasiconvex optimization
by Satoshi Suzuki - 295-320 Extending interval branch-and-bound from two to few objectives in nonlinear multiobjective optimization
by Ignacio Araya & Victor Reyes & Javier Montero - 321-343 Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations
by Godai Azuma & Sunyoung Kim & Makoto Yamashita - 345-379 Partial augmented Lagrangian method for non-Lipschitz mathematical programs with complementarity constraints
by Gao-Xi Li & Xin-Min Yang & Xian-Jun Long - 381-410 Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation
by Jie Zhang & Xinmin Yang - 411-429 Stability analysis of split equality and split feasibility problems
by Vu Thi Huong & Hong-Kun Xu & Nguyen Dong Yen - 431-452 Extended vertical tensor complementarity problems with finite solution sets
by Xue-liu Li & Yi-rong Jiang & Yuning Yang & Guo-ji Tang - 453-481 Revisiting non-monotone regularized submodular maximization: bi-criteria and PASS approximations
by Cheng Lu - 483-508 An exact algorithm for disaster-resilience augmentation of planar straight-line graphs
by Alexander Westcott & Charl Ras
May 2025, Volume 92, Issue 1
- 1-20 Simultaneous convexification for the planar obnoxious facility location problem
by Anatoliy Kuznetsov & Nikolaos V. Sahinidis - 21-54 Tightening state relaxations for global dynamic optimization using dynamic cuts
by Jason Ye & Joseph K. Scott - 55-85 Limited memory bundle DC algorithm for sparse pairwise kernel learning
by Napsu Karmitsa & Kaisa Joki & Antti Airola & Tapio Pahikkala - 87-109 Bundle trust region algorithm based on linear subproblem
by Najmeh Hoseini Monjezi - 111-133 Solution existence for a class of nonsmooth robust optimization problems
by Nguyen Canh Hung & Thai Doan Chuong & Nguyen Hoang Anh - 135-158 Characterisation of zero duality gap for optimization problems in spaces without linear structure
by Ewa Bednarczuk & Monika Syga - 159-186 Using dual relaxations in multiobjective mixed-integer convex quadratic programming
by Marianna Santis & Gabriele Eichfelder & Daniele Patria & Leo Warnow - 187-203 A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces
by G. C. Bento & J. X. Cruz Neto & J. O. Lopes & B. S. Mordukhovich & P. R. Silva Filho - 205-225 Support vector machines with the hard-margin loss: optimal training via combinatorial Benders’ cuts
by Ítalo Santana & Breno Serrano & Maximilian Schiffer & Thibaut Vidal - 227-251 Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles
by Carlos Alegría & Justin Dallant & Pablo Pérez-Lantero & Carlos Seara
April 2025, Volume 91, Issue 4
- 701-742 On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs
by Dillard Robertson & Pengfei Cheng & Joseph K. Scott - 743-763 Conic relaxations for conic minimax convex polynomial programs with extensions and applications
by Thai Doan Chuong & José Vicente-Pérez - 765-786 Applying augmented weak subdifferentials and normal cones for nonconvex mathematical programming problems
by Tran Van Su & Chu Van Tiep - 787-805 Approximations of unbounded convex projections and unbounded convex sets
by Gabriela Kováčová & Birgit Rudloff - 807-828 Maximizing the smallest eigenvalue of grounded Laplacian matrix
by Xiaotian Zhou & Run Wang & Wei Li & Zhongzhi Zhang - 829-850 Stochastic golden ratio algorithm to non-convex stochastic mixed variational inequality problem
by Shenghua Wang & Ziqi Zhu & Lanxiang Yu - 851-895 System architecture optimization strategies: dealing with expensive hierarchical problems
by Jasper H. Bussemaker & Paul Saves & Nathalie Bartoli & Thierry Lefebvre & Rémi Lafage - 897-922 Constrained optimization in simulation: efficient global optimization and Karush-Kuhn-Tucker conditions
by Jack P. C. Kleijnen & Ebru Angün & Inneke Nieuwenhuyse & Wim C. M. Beers - 923-951 Stochastic red-blue set covering: a decomposition approach
by David Islip & Roy H. Kwon - 953-985 On a tractable single-level reformulation of a multilevel model of the European entry-exit gas market with market power
by Veronika Grimm & Julia Grübel & Martin Schmidt & Alexandra Schwartz & Ann-Kathrin Wiertz & Gregor Zöttl
March 2025, Volume 91, Issue 3
- 437-456 Hybridizing two linear relaxation techniques in interval-based solvers
by Ignacio Araya & Frédéric Messine & Jordan Ninin & Gilles Trombettoni - 457-481 A branch-and-bound algorithm for parametric mixed-binary nonlinear programs
by Andrew C. Pangia & Margaret M. Wiecek - 483-510 Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
by Lahcen El Bourkhissi & Ion Necoara - 511-534 Iterative mix thresholding algorithm with continuation technique for mix sparse optimization and application
by Yaohua Hu & Jian Lu & Xiaoqi Yang & Kai Zhang - 535-557 On generalized KKT points for the Motzkin–Straus program
by Guglielmo Beretta & Alessandro Torcinovich & Marcello Pelillo - 559-585 A new modified Halpern-type splitting algorithm for solving monotone inclusion problems in reflexive Banach spaces
by Lulu Chen & Gang Cai & Prasit Cholamjiak & Papatsara Inkrong - 587-609 New iterative algorithms for solving split variational inclusions
by Soumitra Dey & Chinedu Izuchukwu & Adeolu Taiwo & Simeon Reich - 611-646 Inexact proximal methods for weakly convex functions
by Pham Duy Khanh & Boris S. Mordukhovich & Vo Thanh Phat & Dat Ba Tran - 647-676 Adaptive nested Monte Carlo approach for multi-objective efficient global optimization
by Shengguan Xu & Jianfeng Tan & Jiale Zhang & Hongquan Chen & Yisheng Gao - 677-699 Convergence of solutions to set optimization problems with variable ordering structures
by L. Q. Anh & D. V. Hien
February 2025, Volume 91, Issue 2
- 255-256 Preface
by Tibor Csendes & Boglárka G.-Tóth & Tamás Vinkó - 257-286 A revised monotonicity-based method for computing tight image enclosures of functions
by Ignacio Araya & Victor Reyes - 287-310 Global optimization of mixed-integer nonlinear programs with SCIP 8
by Ksenia Bestuzheva & Antonia Chmiela & Benjamin Müller & Felipe Serrano & Stefan Vigerske & Fabian Wegscheider - 311-330 Local search versus linear programming to detect monotonicity in simplicial branch and bound
by L. G. Casado & B. G.-Tóth & E. M. T. Hendrix & F. Messine - 331-353 Global solution of quadratic problems using interval methods and convex relaxations
by Sourour Elloumi & Amélie Lambert & Bertrand Neveu & Gilles Trombettoni - 355-369 Node selection through upper bounding local search methods in branch & bound solvers for NCOPs
by Victor Reyes & Ignacio Araya - 371-392 On polling directions for randomized direct-search approaches: application to beam angle optimization in intensity-modulated proton therapy
by H. Rocha & J. Dias - 393-413 Heteroscedastic Bayesian optimization using generalized product of experts
by Saulius Tautvaišas & Julius Žilinskas - 415-436 On the use of overlapping convex hull relaxations to solve nonconvex MINLPs
by Ouyang Wu & Pavlo Muts & Ivo Nowak & Eligius M. T. Hendrix
January 2025, Volume 91, Issue 1
- 1-37 Global optimization: a machine learning approach
by Dimitris Bertsimas & Georgios Margaritis - 39-58 Smoothing penalty approach for solving second-order cone complementarity problems
by Chieu Thanh Nguyen & Jan Harold Alcantara & Zijun Hao & Jein-Shan Chen - 59-93 Stochastic decomposition for risk-averse two-stage stochastic linear programs
by Prasad Parab & Lewis Ntaimo & Bernardo Pagnoncelli - 95-127 Nested benders decomposition for a deterministic biomass feedstock logistics problem
by Sanchit Singh & Subhash C. Sarin & Sandeep Singh Sangha - 129-153 Solving a class of two-stage stochastic nonlinear integer programs using value functions
by Junlong Zhang & Osman Y. Özaltın & Andrew C. Trapp - 155-170 On e-monotonicity and maximality of operators in Banach spaces
by M. H. Alizadeh & M. Bianchi & R. Pini - 171-197 Pointwise expected hypervolume improvement for expensive multi-objective optimization
by Li Mei & Zhan Dawei - 199-215 Existence of weak efficient solutions of set-valued optimization problems
by Fatemeh Fakhar & Hamid Reza Hajisharifi & Zeinab Soltani - 217-234 Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization
by V. T. Hieu & E. A. S. Köbis & M. A. Köbis & P. H. Schmölling - 235-253 Inexact primal-dual active set iteration for optimal distribution control of stationary heat or cold source
by Mengdi Hu & Haiming Song & Jiageng Wu & Jinda Yang
December 2024, Volume 90, Issue 4
- 813-842 Robust bilevel optimization for near-optimal lower-level solutions
by Mathieu Besançon & Miguel F. Anjos & Luce Brotcorne - 843-868 On convergence of a q-random coordinate constrained algorithm for non-convex problems
by A. Ghaffari-Hadigheh & L. Sinjorgo & R. Sotirov - 869-890 Novel algorithms based on forward-backward splitting technique: effective methods for regression and classification
by Yunus Atalan & Emirhan Hacıoğlu & Müzeyyen Ertürk & Faik Gürsoy & Gradimir V. Milovanović - 891-907 Strong convergence of the composition of firmly nonexpansive mappings
by José Márcio Machado Brito & João Xavier Cruz Neto & Ítalo Dowell Lira Melo - 909-930 Relaxed projection methods for solving variational inequality problems
by Pham Ngoc Anh - 931-963 A reformulation-enumeration MINLP algorithm for gas network design
by Yijiang Li & Santanu S. Dey & Nikolaos V. Sahinidis - 965-982 Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem
by Pengxiang Pan & Junran Lichen & Jianping Li - 983-1006 Improved approximation algorithms for the k-path partition problem
by Shiming Li & Wei Yu & Zhaohui Liu - 1007-1030 Budget-constrained profit maximization without non-negative objective assumption in social networks
by Suning Gong & Qingqin Nong & Yue Wang & Dingzhu Du - 1031-1067 Aircraft conflict resolution with trajectory recovery using mixed-integer programming
by Fernando Dias & David Rey
November 2024, Volume 90, Issue 3
- 573-592 A method based on parametric convex programming for solving convex multiplicative programming problem
by Yunchol Jong & Yongjin Kim & Hyonchol Kim - 593-617 Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric
by Vlasta Kaňková - 619-649 Online non-monotone diminishing return submodular maximization in the bandit setting
by Jiachen Ju & Xiao Wang & Dachuan Xu - 651-669 Optimality analysis for $$\epsilon $$ ϵ -quasi solutions of optimization problems via $$\epsilon $$ ϵ -upper convexificators: a dual approach
by Tran Su - 671-689 Packing spheres with quasi-containment conditions
by Andreas Fischer & Igor Litvinchev & Tetyana Romanova & Petro Stetsyuk & Georgiy Yaskov - 691-710 Curvature-constrained Steiner networks with three terminals
by Peter A. Grossman & David Kirszenblat & Marcus Brazil & J. Hyam Rubinstein & Doreen A. Thomas - 711-726 Modified general splitting method for the split feasibility problem
by Seakweng Vong & Zhongsheng Yao - 727-753 A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression
by Weiyang Ding & Michael K. Ng & Wenxing Zhang - 755-779 A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming
by Alfredo Iusem & Felipe Lara & Raúl T. Marcavillaca & Le Hai Yen - 781-811 Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
by Thai Doan Chuong & Xinghuo Yu & Andrew Eberhard & Chaojie Li & Chen Liu
October 2024, Volume 90, Issue 2
- 293-322 On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
by Yuzhou Qiu & E. Alper Yıldırım - 323-353 Tighter bound estimation for efficient biquadratic optimization over unit spheres
by Shigui Li & Linzhang Lu & Xing Qiu & Zhen Chen & Delu Zeng - 355-371 Dual optimality conditions for the difference of extended real valued increasing co-radiant functions
by Mohammad Hossein Daryaei & Hossein Mohebi - 373-399 Optimization in complex spaces with the mixed Newton method
by Sergei Bakhurin & Roland Hildebrand & Mohammad Alkousa & Alexander Titov & Nikita Yudin - 401-428 A Bayesian approach to data-driven multi-stage stochastic optimization
by Zhiping Chen & Wentao Ma - 429-458 Deep learning the efficient frontier of convex vector optimization problems
by Zachary Feinstein & Birgit Rudloff - 459-485 A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems
by Pouya Aghaei pour & Jussi Hakanen & Kaisa Miettinen - 487-514 A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines
by Yuping Cui & Guolei Zheng - 515-549 The edge labeling of higher order Voronoi diagrams
by Mercè Claverol & Andrea de las Heras Parrilla & Clemens Huemer & Alejandra Martínez-Moraian - 551-571 Rectilinear convex hull of points in 3D and applications
by Pablo Pérez-Lantero & Carlos Seara & Jorge Urrutia
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