default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Optimization Theory and Applications, Volume 209
Volume 209, Number 1, April 2026
- Mitsuaki Obara
, Takayuki Okuno, Akiko Takeda:
Local Near-Quadratic Convergence of Riemannian Interior Point Methods. 1 - Massimiliano Ferrara:
Geometric-Entropic Optimization: Integrating Optimal Transport with Riemannian Gradient Methods for Neural Network Training. 2 - Andrea Brilli, Andrea Cristofari, Giampaolo Liuzzi, Stefano Lucidi:
Complexity Results and Active-Set Identification of a Derivative-Free Method for Bound-Constrained Problems. 3 - Xi-Rong Peng, Yun-Kang Sui:
Reconstruction of Structural Topology Optimization Mapping: A Novel Two-Stage Mapping Modeling and Solution Approach. 4 - Hédy Attouch, Jalal Fadili, Vyacheslav Kungurtsev:
The Stochastic Ravine Accelerated Gradient Method with General Extrapolation Coefficients. 5 - Zhiang Zhou, Zhongcheng Deng, Caiping Liu, Kequan Zhao:
Proper Subdifferential of Set-Valued Maps and its Applications in Linear Spaces. 6 - Jingyu Gao, Xiurui Geng:
A Note on the Second-Order Convergence of Proximal ADMM for Non-Convex Optimization. 7 - Wen-Bin Wei, Jian-Wen Peng, Elisabeth Köbis, Jen-Chih Yao:
Characterization of Approximate Efficient Solutions of Nonconvex Vector Optimization Problems. 8 - Roger Behling, Douglas Soares Gonçalves, Hugo Lara, Harry Oviedo:
A Projected Inexact Levenberg-Marquardt Method for the Completely Positive Matrix Factorization. 9 - Xuan Thanh Le, Tran Van Thang:
A Novel Proximal-Based Algorithm for Mixed Set-Valued Quasi-Variational Inequalities. 10 - Didier Aussel, Orestes Bueno, Carlos Calderón, John Edwin Cotrina:
Toward Tractable Conditions for Lower Semicontinuity of Set-Valued Maps: Concepts and Applications. 11 - Dinh Van Tiep, Duong Thi Viet An, Nguyen Thi Ngoc Oanh, Nguyen Thanh Son:
A Generalized Canonical Metric for Optimization on the Indefinite Stiefel Manifold. 12 - Qingying Hu, Bo Wang, Mengwei Xu:
Convergence Properties of Gradient-Based Methods for Minimax Problems with Nonlinear Constraints. 13 - Xue Li, Wei Bian:
Smoothing Proximal Gradient Block-coordinate Algorithms for Group Sparse ℓ 0 Regularized Nonsmooth Convex Regression Problem. 14 - Anjali Rawat, Vinay Singh:
Augmented Lagrangian Neural Network for Solving Mathematical Programs with Equilibrium Constraints. 15 - Hongwei Jiao, Haibing Ma:
Spatial Algorithm for Mixed Integer Generalized Affine Multiplicative Problems. 16 - Vahid Darvish, Godwin Chidi Ugwunnadi, Aniefiok Udomene, Habib ur Rehman:
Golden Ratio Algorithm with Inertia for Non-Lipschitz Variational Inequalities. 17 - Aleksandr Beznosikov, Georgiy Kormakov, Alexander Grigorievskiy, Mikhail Rudakov, Ruslan Nazykov, Alexander Rogozin, Anton Vakhrushev, Andrey V. Savchenko, Martin Takác, Alexander V. Gasnikov:
Exploring New Frontiers in Vertical Federated Learning: the Role of Saddle Point Reformulation. 18 - Xian-Jun Long, Kang Zeng, Gao-Xi Li, Minh N. Dao, Zai-Yun Peng:
Variable Smoothing Alternating Proximal Gradient Algorithm for Coupled Composite Optimization. 19 - Shengda Zeng, Jinsheng Du, Stanislaw Migórski:
Existence of Pullback Attractors for a Class of Differential Quasi-Variational-Hemivariational Inequalities. 20 - Roberto Andreani, Mariana da Rosa, Leonardo D. Secchin:
A New Constant-Rank-Type Condition Related to MFCQ and Local Error Bounds. 21 - Xinwei Feng, Jianhui Huang, Yunxiao Jia:
Mean-Field Team with Nested Model Uncertainty: A Stackelberg-Type Robust Analysis. 22 - Cristopher Hermosilla, Ernesto Treumún, Peter R. Wolenski:
Self-dual Approximations to Convex Bolza Problems. 23
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 2026-04-17 00:08 CEST 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:
