default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 84
Volume 84, Number 1, January 2023
- Valeria Ruggiero, Gerardo Toraldo:
Special issue for SIMAI 2020-2021: large-scale optimization and applications. 1-4 - Laura Antonelli
, Valentina De Simone, Marco Viola:
Cartoon-texture evolution for two-region image segmentation. 5-26 - Annamaria Barbagallo, Serena Guarino Lo Bianco:
A random time-dependent noncooperative equilibrium problem. 27-52 - Stefania Bellavia, Natasa Krejic, Benedetta Morini, Simone Rebegoldi:
A stochastic first-order trust-region method with inexact restoration for finite-sum minimization. 53-84 - Silvia Bonettini, Marco Prato, Simone Rebegoldi:
A nested primal-dual FISTA-like scheme for composite convex optimization problems. 85-123 - Pasquale Cascarano, Giorgia Franchini, Erich Kobler, Federica Porta, Andrea Sebastiani:
Constrained and unconstrained deep image prior optimization models with automatic regularization. 125-149 - Serena Crisci, Federica Porta, Valeria Ruggiero, Luca Zanni:
Hybrid limited memory gradient projection methods for box-constrained optimization problems. 151-189 - Dominik Garmatter, Margherita Porcelli, Francesco Rinaldi, Martin Stoll:
An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations. 191-223 - Francesco Rinaldi, Damiano Zeffiro:
Avoiding bad steps in Frank-Wolfe variants. 225-264 - Bernhard Stankewitz, Nicole Mücke, Lorenzo Rosasco:
From inexact optimization to learning via gradient concentration. 265-294
Volume 84, Number 2, March 2023
- José Yunier Bello Cruz, Max L. N. Gonçalves, Nathan Krislock:
On FISTA with a relative error rule. 295-318 - Silvia Bonettini, Peter Ochs, Marco Prato, Simone Rebegoldi:
An abstract convergence framework with application to inertial inexact forward-backward methods. 319-362 - Ademir Alves Aguiar, Orizon Pereira Ferreira, Leandro da Fonseca Prudente:
Inexact gradient projection method with relative error tolerance. 363-395 - Orizon Pereira Ferreira, Geovani Nunes Grapiglia, Elianderson M. Santos, João Carlos de Oliveira Souza:
A subgradient method with non-monotone line search. 397-420 - Jiawang Nie, Suhan Zhong:
Loss functions for finite sets. 421-447 - Andrew Butler, Roy H. Kwon:
Efficient differentiable quadratic programming layers: an ADMM approach. 449-476 - Zhikai Yang, Le Han:
A global exact penalty for rank-constrained optimization problem and applications. 477-508 - Yuning Yang:
On global convergence of alternating least squares for tensor approximation. 509-529 - Juan Gao, Xinwei Liu, Yu-Hong Dai, Yakui Huang, Junhua Gu:
Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization. 531-572 - Serge Gratton, Philippe L. Toint:
OFFO minimization algorithms for second-order optimality and their complexity. 573-607 - Kaizhao Sun, X. Andy Sun:
A two-level distributed algorithm for nonconvex constrained optimization. 609-649
Volume 84, Number 3, April 2023
- Brian Irwin, Eldad Haber:
Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition. 651-702 - Immanuel M. Bomze, Bo Peng:
Conic formulation of QPCCs applied to truly sparse QPs. 703-735 - Jie Zhang, Xinmin Yang, Gaoxi Li, Ke Zhang:
A smoothing proximal gradient algorithm with extrapolation for the relaxation of ℓ0 regularization problem. 737-760 - Quan Yu, Xinzhen Zhang:
T-product factorization based method for matrix and tensor completion problems. 761-788 - Renaud Chicoisne:
Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes. 789-831 - Naoki Marumo, Takayuki Okuno, Akiko Takeda:
Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares. 833-874 - Yitian Qian, Shaohua Pan, Shujun Bi:
A matrix nonconvex relaxation approach to unconstrained binary polynomial programs. 875-919 - Claire Boyer, Antoine Godichon-Baggioni:
On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions. 921-972 - Shisen Liu, Xiaojun Chen:
Lifted stationary points of sparse optimization with complementarity constraints. 973-1003 - Yonggang Pei, Shaofang Song, Detong Zhu:
A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization. 1005-1033
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-11-07 20:34 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:
