Printed from https://ideas.repec.org/s/spr/jglopt2.html
Content
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
January 2023, Volume 85, Issue 1
- 1-13 Finding the set of global minimizers of a piecewise affine function
by Majid E. Abbasov - 15-38 A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice
by Suning Gong & Qingqin Nong & Shuyu Bao & Qizhi Fang & Ding-Zhu Du - 39-59 Packing convex polygons in minimum-perimeter convex hulls
by Josef Kallrath & Tatiana Romanova & Alexander Pankratov & Igor Litvinchev & Luis Infante - 61-80 Regrets of proximal method of multipliers for online non-convex optimization with long term constraints
by Liwei Zhang & Haoyang Liu & Xiantao Xiao - 81-110 Second order analysis for robust inclusion systems and applications
by V. D. Thinh & T. D. Chuong & N. L. H. Anh - 111-128 On maximum-sum matchings of points
by Sergey Bereg & Oscar P. Chacón-Rivera & David Flores-Peñaloza & Clemens Huemer & Pablo Pérez-Lantero & Carlos Seara - 129-153 DC auxiliary principle methods for solving lexicographic equilibrium problems
by Pham Ngoc Anh & Qamrul Hasan Ansari & Ho Phi Tu - 155-183 On the second-order optimality conditions for multi-objective optimal control problems with mixed pointwise constraints
by Bui Trong Kien & Trinh Duy Binh - 185-234 Optimising portfolio diversification and dimensionality
by M. Barkhagen & S. García & J. Gondzio & J. Kalcsics & J. Kroeske & S. Sabanis & A. Staal - 235-249 Characterizations of set order relations and nonlinear scalarizations via generalized oriented distance function in set optimization
by Khushboo & C. S. Lalitha - 251-255 Book review on “Convex Analysis and Beyond. Volume I: Basic Theory”, a monograph by Boris S. Mordukhovich and Nguyen Mau Nam
by Nguyen Dong Yen
December 2022, Volume 84, Issue 4
- 807-842 Alternative regularizations for Outer-Approximation algorithms for convex MINLP
by David E. Bernal & Zedong Peng & Jan Kronqvist & Ignacio E. Grossmann - 843-867 Discretization and global optimization for mixed integer bilinear programming
by Xin Cheng & Xiang Li - 869-912 Compact mixed-integer programming formulations in quadratic optimization
by Benjamin Beach & Robert Hildebrand & Joey Huchette - 913-939 Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
by Maryam Yashtini - 941-966 Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
by Jing Zhao & Qiao-Li Dong & Michael Th. Rassias & Fenghui Wang - 967-987 A generalized block-iterative projection method for the common fixed point problem induced by cutters
by Yair Censor & Daniel Reem & Maroun Zaknoon - 989-1003 On the maxima of motzkin-straus programs and cliques of graphs
by Qingsong Tang & Xiangde Zhang & Cheng Zhao & Peng Zhao - 1005-1032 A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations
by William La Cruz - 1033-1051 Tight bounds on the maximal perimeter and the maximal width of convex small polygons
by Christian Bingane - 1053-1077 Kernel density estimation based distributionally robust mean-CVaR portfolio optimization
by Wei Liu & Li Yang & Bo Yu
November 2022, Volume 84, Issue 3
- 527-561 On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
by V. S. Amaral & R. Andreani & E. G. Birgin & D. S. Marcondes & J. M. Martínez - 563-589 Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak–Łojasiewicz condition
by Vassilis Apidopoulos & Nicolò Ginatta & Silvia Villa - 591-606 Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
by Sven de Vries & Bernd Perscheid - 607-650 An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities
by Maximilian Merkert & Galina Orlinskaya & Dieter Weninger - 651-685 On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints
by Holger Heitsch & René Henrion & Thomas Kleinert & Martin Schmidt - 687-714 Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
by Jianping Li & Wencheng Wang & Junran Lichen & Suding Liu & Pengxiang Pan - 715-738 Inverse max+sum spanning tree problem under weighted $$l_{\infty }$$ l ∞ norm by modifying max-weight vector
by Junhua Jia & Xiucui Guan & Qiao Zhang & Xinqiang Qian & Panos M. Pardalos - 739-753 Scalar and vector equilibrium problems with pairs of bifunctions
by Mircea Balaj - 755-781 A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence
by Takehiro Sano & Tsuyoshi Migita & Norikazu Takahashi - 783-805 Simultaneous distributed-boundary optimal control problems driven by nonlinear complementarity systems
by Jinxia Cen & Tahar Haddad & Van Thien Nguyen & Shengda Zeng
October 2022, Volume 84, Issue 2
- 255-293 Data-driven stochastic optimization for distributional ambiguity with integrated confidence region
by Steffen Rebennack - 295-320 Scalarization and robustness in uncertain vector optimization problems: a non componentwise approach
by Elisa Caprari & Lorenzo Cerboni Baiardi & Elena Molho - 321-347 Global dynamic optimization with Hammerstein–Wiener models embedded
by Chrysoula D. Kappatou & Dominik Bongartz & Jaromił Najman & Susanne Sass & Alexander Mitsos - 349-368 Strong subdifferentials: theory and applications in nonconvex optimization
by A. Kabgani & F. Lara - 369-392 An adaptive high order method for finding third-order critical points of nonconvex optimization
by Xihua Zhu & Jiangze Han & Bo Jiang - 393-413 Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
by Nan Meng & Yun-Bin Zhao & Michal Kočvara & Zhongfeng Sun - 415-440 Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
by Meng-Meng Zheng & Zheng-Hai Huang & Sheng-Long Hu - 441-464 New inertial forward-backward type for variational inequalities with Quasi-monotonicity
by Chinedu Izuchukwu & Yekini Shehu & Jen-Chih Yao - 465-489 Hopping between distant basins
by Maldon Goodridge & John Moriarty & Jure Vogrinc & Alessandro Zocca - 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