default search action
Journal of Global Optimization, Volume 90
Volume 90, Number 1, September 2024
- Orizon Pereira Ferreira, Yingchao Gao, Sándor Zoltán Németh, Petra Renáta Rigó:
Gradient projection method on the sphere, complementarity problems and copositivity. 1-25 - Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu
:
Relaxations and cutting planes for linear programs with complementarity constraints. 27-51 - Duong Thi Viet An
Optimality conditions and sensitivity analysis in parametric nonconvex minimax programming. 53-72 - Jiefei He, Huiling Zhang, Zi Xu
An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms. 73-92 - Shichen Liao, Congying Han
Subspace Newton method for sparse group ℓ 0 optimization problem. 93-125 - Simeon Reich, Truong Minh Tuyen, Nguyen Song Ha:
A new optimization approach to solving split equality problems in Hilbert spaces. 127-151 - Chhavi Sharma, Vishnu Narayanan, P. Balamurugan:
Distributed accelerated gradient methods with restart under quadratic growth condition. 153-215 - Duong Thi Kim Huyen
Characteristic sets and characteristic numbers of matrix two-person games. 217-241 - Jacek Szybowski, Konrad Kulakowski
Almost optimal manipulation of pairwise comparisons of alternatives. 243-259 - Chiara Donnini
Social equity in international environmental agreements. 261-291
Volume 90, Number 2, October 2024
- Yuzhou Qiu, E. Alper Yildirim
On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints. 293-322 - Shigui Li, Linzhang Lu, Xing Qiu, Zhen Chen, Delu Zeng
Tighter bound estimation for efficient biquadratic optimization over unit spheres. 323-353 - Mohammad Hossein Daryaei, Hossein Mohebi
Dual optimality conditions for the difference of extended real valued increasing co-radiant functions. 355-371 - Sergey Bakhurin, Roland Hildebrand
Optimization in complex spaces with the mixed Newton method. 373-399 - Zhiping Chen
A Bayesian approach to data-driven multi-stage stochastic optimization. 401-428 - Zachary Feinstein, Birgit Rudloff
Deep learning the efficient frontier of convex vector optimization problems. 429-458 - Pouya Aghaei Pour
A surrogate-assisted a priori multiobjective evolutionary algorithm for constrained multiobjective optimization problems. 459-485 - Yuping Cui, Guolei Zheng
A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines. 487-514 - Mercè Claverol, Andrea de las Heras Parrilla, Clemens Huemer, Alejandra Martínez-Moraian
The edge labeling of higher order Voronoi diagrams. 515-549 - Pablo Pérez-Lantero
Rectilinear convex hull of points in 3D and applications. 551-571
Volume 90, Number 3, November 2024
- Yunchol Jong, Yongjin Kim, Hyonchol Kim:
A method based on parametric convex programming for solving convex multiplicative programming problem. 573-592 - Vlasta Kanková
Stochastic optimization problems with nonlinear dependence on a probability measure via the Wasserstein metric. 593-617 - Jiachen Ju, Xiao Wang
Online non-monotone diminishing return submodular maximization in the bandit setting. 619-649 - Tran Van Su
Optimality analysis for ε-quasi solutions of optimization problems via ε-upper convexificators: a dual approach. 651-669 - Andreas Fischer
Packing spheres with quasi-containment conditions. 671-689 - Peter Alexander Grossman
Curvature-constrained Steiner networks with three terminals. 691-710 - Seakweng Vong, Zhongsheng Yao
Modified general splitting method for the split feasibility problem. 711-726 - Weiyang Ding, Michael K. Ng, Wenxing Zhang:
A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression. 727-753 - Alfredo Noel Iusem, Felipe Lara
A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming. 755-779 - Thai Doan Chuong
Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling. 781-811
Volume 90, Number 4, December 2024
- Mathieu Besançon, Miguel F. Anjos
Robust bilevel optimization for near-optimal lower-level solutions. 813-842 - Alireza Ghaffari-Hadigheh, Lennart Sinjorgo
On convergence of a q-random coordinate constrained algorithm for non-convex problems. 843-868 - Yunus Atalan, Emirhan Hacioglu
Novel algorithms based on forward-backward splitting technique: effective methods for regression and classification. 869-890 - José Márcio Machado de Brito, João Xavier da Cruz Neto
Strong convergence of the composition of firmly nonexpansive mappings. 891-907 - Pham Ngoc Anh
Relaxed projection methods for solving variational inequality problems. 909-930 - Yijiang Li, Santanu S. Dey
A reformulation-enumeration MINLP algorithm for gas network design. 931-963 - Pengxiang Pan
Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem. 965-982 - Shiming Li, Wei Yu
Improved approximation algorithms for the k-path partition problem. 983-1006 - Suning Gong, Qingqin Nong
Budget-constrained profit maximization without non-negative objective assumption in social networks. 1007-1030 - Fernando H. C. Dias
Aircraft conflict resolution with trajectory recovery using mixed-integer programming. 1031-1067
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 2024-12-23 19:18 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: