default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 87
Volume 87, Number 1, September 2023
- Anna Nagurney
, Dana Hassani, Oleg Nivievskyi, Pavlo Martyshev:
Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities. 1-30 - Zelda B. Zabinsky, David D. Linz:
Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise. 31-55 - Jason Ye, Joseph K. Scott:
Extended McCormick relaxation rules for handling empty arguments representing infeasibility. 57-95 - Moritz Link, Stefan Volkwein:
Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs. 97-132 - Jan Pablo Burgard, Carina Moreira Costa, Christopher Hojny, Thomas Kleinert, Martin Schmidt:
Mixed-integer programming techniques for the minimum sum-of-squares clustering problem. 133-189 - Huixian Wu, Hezhi Luo, Xianye Zhang, Haiqiang Qi:
An effective global algorithm for worst-case linear optimization under polyhedral uncertainty. 191-219 - Markus Gabl:
Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization. 221-254 - Yingzhe Xu, Cheng Lu, Zhibin Deng, Ya-Feng Liu:
New semidefinite relaxations for a class of complex quadratic programming problems. 255-275 - Xue Gao, Xingju Cai, Xiangfeng Wang, Deren Han:
An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant. 277-300 - Iago A. Carvalho, Amadeu Almeida Coco:
On solving bi-objective constrained minimum spanning tree problems. 301-323
Volume 87, Number 2, November 2023
- Ya-Feng Liu, Zi Xu, Pavlo A. Krokhmal, Jiming Peng:
Preface: special issue of MOA 2020. 325-327 - Shane T. Barratt, Stephen P. Boyd:
Fitting feature-dependent Markov chains. 329-346 - Xiaojun Chen, Lili Pan, Naihua Xiu:
Solution sets of three sparse optimization problems for multivariate regression. 347-371 - Maolin Che, Yimin Wei, Yanwei Xu:
Randomized algorithms for the computation of multilinear rank-(μ 1,μ 2,μ 3) approximations. 373-403 - Wenjie Wang, Haibin Chen, Yiju Wang, Guanglu Zhou:
A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors. 405-422 - Ting Li, Xingju Cai, Yongzhong Song, Yumin Ma:
Improved variance reduction extragradient method with line search for stochastic variational inequalities. 423-446 - Haoming Liu, Kangkang Deng, Haoyang Liu, Zaiwen Wen:
An Entropy-Regularized ADMM For Binary Quadratic Programming. 447-479 - Juan Liu, Xian-Jun Long, Xiang-Kai Sun:
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials. 481-501 - Huixian Wu, Hezhi Luo, Xianye Zhang, Jianzhen Liu:
A new global algorithm for factor-risk-constrained mean-variance portfolio selection. 503-532 - Rui Liu, Deren Han, Yong Xia:
An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization. 533-550 - Jingjing Shen, Ziqi Wang, Zi Xu:
Zeroth-order single-loop algorithms for nonconvex-linear minimax problems. 551-580 - Hongmei Chen, Guoyong Gu, Jun-Feng Yang:
A golden ratio proximal alternating direction method of multipliers for separable convex optimization. 581-602 - Lu Han, Dachuan Xu, Yicheng Xu, Ping Yang:
Approximation algorithms for the individually fair k-center with outliers. 603-618 - Haitao Che, Yaru Zhuang, Yiju Wang, Haibin Chen:
A relaxed inertial and viscosity method for split feasibility problem and applications to image recovery. 619-639 - Jiayun Rao, Na Huang:
A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations. 641-677 - Xiaojiao Tong, Manlan Li, Hailin Sun:
Decision bounding problems for two-stage distributionally robust stochastic bilevel optimization. 679-707 - Zhongruo Wang, Krishnakumar Balasubramanian, Shiqian Ma, Meisam Razaviyayn:
Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities. 709-740 - Chang He, Bo Jiang, Xihua Zhu:
Quaternion matrix decomposition and its theoretical implications. 741-758 - Zai-Yun Peng, Xue-Jing Chen, Yun-Bin Zhao, Xiao-Bing Li:
Painlevé-Kuratowski convergence of minimal solutions for set-valued optimization problems via improvement sets. 759-781 - Dali Chen, Yuwei Wu, Jingquan Li, Xiaohui Ding, Caihua Chen:
Distributionally robust mean-absolute deviation portfolio optimization using wasserstein metric. 783-805 - Jiawei Chen, Yu-Hong Dai:
Multiobjective optimization with least constraint violation: optimality conditions and exact penalization. 807-830 - He Shi, Qingna Li:
A facial reduction approach for the single source localization problem. 831-855 - Hao Hu, Xinxin Li, Jiageng Wu:
A note on the SDP relaxation of the minimum cut problem. 857-876 - Kui Jing, Xin Liu, Fengmin Xu, Donglei Du:
Data-trading coordination with government subsidy. 877-915 - Jian Sun, Zan-Bo Zhang, Yannan Chen, Deren Han, Donglei Du, Xiaoyan Zhang:
A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis. 917-937 - Xin Yang, Lingling Xu:
Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems. 939-964 - Changjie Fang, Liliang Hu, Shenglan Chen:
An inexact primal-dual method with correction step for a saddle point problem in image debluring. 965-988 - Chenyang Xu, Guochuan Zhang:
Learning-augmented algorithms for online subset sum. 989-1008 - Caixia Kou, Han Yang:
A mini-batch stochastic conjugate gradient algorithm with variance reduction. 1009-1025 - Rui-Jin Zhang, Xin-Wei Liu, Yu-Hong Dai:
IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming. 1027-1053
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-15 20:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
