default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Global Optimization, Volume 89
Volume 89, Number 1, May 2024
- Dawid Tarlowski
:
On asymptotic convergence rate of random search. 1-31 - Eyal Cohen, D. Russell Luke, Titus Pinta, Shoham Sabach, Marc Teboulle:
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis. 33-55 - Xue-liu Li, Guo-ji Tang:
Strict feasibility for the polynomial complementarity problem. 57-71 - Lulin Tan, Wei Hong Yang, Jinbiao Pan:
Existence of solutions to Γ-robust counterparts of gap function formulations of uncertain LCPs with ellipsoidal uncertainty sets. 73-92 - Fusheng Bai, Dongchi Zou, Yutao Wei:
A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization. 93-115 - Jie Jiang, Hailin Sun:
Discrete approximation for two-stage stochastic variational inequalities. 117-142 - Zhen-Ping Yang, Yong Zhao, Gui-Hua Lin:
Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities. 143-170 - E. L. Dias Júnior, Pedro Jorge Sousa dos Santos, Antoine Soubeyran, João Carlos de Oliveira Souza:
On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective. 171-196 - Quoc Tran-Dinh:
Extragradient-type methods with $\mathcal {O}\left( 1/k\right) $ last-iterate convergence rates for co-hypomonotone inclusions. 197-221 - Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser:
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies. 223-257
Volume 89, Number 2, June 2024
- Vladimir I. Norkin:
The exact projective penalty method for constrained optimization. 259-276 - Jing-jing Wang, Liping Tang, Xinmin Yang:
Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem. 277-302 - Jiawei Chen, Huasheng Su, Xiaoqing Ou, Yibing Lv:
First- and second-order optimality conditions of nonsmooth sparsity multiobjective optimization via variational analysis. 303-325 - Xianfu Wang, Ziyuan Wang:
A Bregman inertial forward-reflected-backward method for nonconvex minimization. 327-354 - Yingkai Song, Paul I. Barton:
Generalized derivatives of optimal-value functions with parameterized convex programs embedded. 355-378 - Luze Xu, Jon Lee:
Gaining or losing perspective for convex multivariate functions on a simplex. 379-413 - Daniela Lera, Maria Chiara Nasso, Mikhail Posypkin, Yaroslav D. Sergeyev:
Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots. 415-434 - Sanchit Singh, Subhash C. Sarin, Ming Cheng:
Single-lot, lot-streaming problem for a 1 + m hybrid flow shop. 435-455 - Charlie Vanaret:
Interval constraint programming for globally solving catalog-based categorical optimization. 457-476 - Xin Cheng, Xiang Li:
A strong P-formulation for global optimization of industrial water-using and treatment networks. 477-507
Volume 89, Number 3, July 2024
- Marc C. Robini, Lihui Wang, Yuemin Zhu:
The appeals of quadratic majorization-minimization. 509-558 - Abbas Khademi, Ahmadreza Marandi, Majid Soleimani-Damaneh:
A new dual-based cutting plane algorithm for nonlinear adjustable robust optimization. 559-595 - Hongwei Jiao, Binbin Li, Wenqiang Yang:
A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems. 597-632 - Kristian Sabo, Rudolf Scitovski, Sime Ungar, Zoran Tomljanovic:
A method for searching for a globally optimal k-partition of higher-dimensional datasets. 633-653 - Sabah Bushaj, I. Esra Büyüktahtakin:
A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack. 655-685 - Zehao Xiao, Liwei Zhang:
Regret analysis of an online majorized semi-proximal ADMM for online composite optimization. 687-722 - Balendu Bhooshan Upadhyay, Arnav Ghosh, Savin Treanta:
Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds. 723-744 - Kathrin Klamroth, Michael Stiglmayr, Claudia Totzeck:
Consensus-based optimization for multi-objective problems: a multi-swarm approach. 745-776 - Cheng Lu, Wenguo Yang:
Fast deterministic algorithms for non-submodular maximization with strong performance guarantees. 777-801 - Marco Baioletti, Valentino Santucci, Marco Tomassini:
A performance analysis of Basin hopping compared to established metaheuristics for global optimization. 803-832
Volume 89, Number 4, August 2024
- Jason Ye, Joseph K. Scott:
Modification and improved implementation of the RPD method for computing state relaxations for global dynamic optimization. 833-861 - Hongwei Liu, Ting Wang, Zexian Liu:
A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems. 863-897 - Jianghua Yin, Chunming Tang, Jinbao Jian, Qiongxuan Huang:
A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization. 899-926 - Le Thi Khanh Hien, Dimitri Papadimitriou:
An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints. 927-948 - Zhou Sheng, Gonglin Yuan:
Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds. 949-974 - Gabriela Kovácová, Firdevs Ulus:
Computing the recession cone of a convex upper image via convex projection. 975-994 - Maolin Che, Yimin Wei, Hong Yan:
Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering. 995-1032 - Dmitry V. Gribanov, Ivan A. Shumilov, Dmitry S. Malyshev, Nikolai Yu. Zolotykh:
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems. 1033-1067 - Yonghong Yao, Abubakar Adamu, Yekini Shehu, Jen-Chih Yao:
Simple proximal-type algorithms for equilibrium problems. 1069-1098 - Anveksha Moar, Pradeep Kumar Sharma, C. S. Lalitha:
Nonlinear scalarization in set optimization based on the concept of null set. 1099-1119
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-29 21:20 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:
