default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 93
Volume 93, Number 1, January 2026
- Amal Alphonse
, Constantin Christof, Michael Hintermüller, Ioannis P. A. Papadopoulos:
A globalized inexact semismooth Newton method for nonsmooth fixed-point equations involving variational inequalities. 1-55 - Matteo Bergamaschi, Andrea Cristofari, Vyacheslav Kungurtsev, Francesco Rinaldi:
Probabilistic iterative hard thresholding for sparse learning. 57-83 - Margherita Porcelli, Giovanni Seraghiti, Philippe L. Toint:
prunAdag: an adaptive pruning-aware gradient method. 85-119 - Xin He, Yaping Fang:
Accelerated forward-backward algorithms with subgradient corrections. 121-156 - Natasa Krklec Jerinkic, Federica Porta, Valeria Ruggiero, Ilaria Trombini:
Variable metric proximal stochastic gradient methods with additional sampling. 157-207 - Giacomo Cristinelli, José A. Iglesias, Daniel Walter:
Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach. 209-265 - Keisuke Murakami, Takeaki Uno:
A heuristic algorithm for the cluster editing problem. 267-301 - Zhongming Wu, Liu Yang, Valentina De Simone:
Behavioral portfolio optimization via cumulative prospect theory with a symmetric alternating direction method of multipliers. 303-334 - Hezhi Luo, Tianxing Gou, Huixian Wu, Qian Li:
A novel global algorithm for optimal portfolio selection with maximum relative marginal risk via SCO method and SOCP relaxation. 335-372 - Meiying Wang, Hongwei Liu, Jun Yang:
A reconsideration of quasimonotone variational inequality problems. 373-395 - Abilio Lucena, Luidi Simonetti, Alexandre Salles da Cunha:
Formulations and algorithms for the simple cycle problem. 397-433 - Milan Hladík, Hossein Moosaei, Fakhrodin Hashemi, Saeed Ketabchi, Panos M. Pardalos:
An overview of absolute value equations: from theory to solution methods and challenges. 435-488
Volume 93, Number 2, March 2026
- Niloofar Fadavi, Harsha Gangammanavar:
Active set-based inexact proximal bundle algorithm for stochastic quadratic programming. 489-521 - Feng-Yi Liao, Lijun Ding, Yang Zheng:
An overview and comparison of spectral bundle methods for primal and dual semidefinite programs. 523-566 - Andreas Fischer, Alexey F. Izmailov, Maik Punke, Zhibai Yan:
Error bounds and Newton-type methods for reformulations of Karush-Kuhn-Tucker systems of mathematical programs with complementarity constraints. 567-599 - Alexey F. Izmailov, Mikhail V. Solodov:
Transformations of variables and transformations of equations via the perturbed Newton method framework. 601-616 - Konstantinos A. Oikonomidis, Alexander Bodard, Emanuel Laude, Panagiotis Patrinos:
Global convergence analysis of the power proximal point and augmented Lagrangian method. 617-649 - Ya-xiang Yuan, Yi Zhang:
Symplectic discretization approach for developing new proximal point algorithm. 651-687 - Lahcen El Bourkhissi, Ion Necoara:
Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints. 689-727 - M. Marques Alves, Dirk A. Lorenz, Emanuele Naldi:
A general framework for inexact splitting algorithms with relative errors and applications to Chambolle-Pock and Davis-Yin methods. 729-763 - Fan Wu, Jiazhen Wei, Wei Bian:
Extrapolated hard thresholding algorithms with finite length for composite ℓ 0 penalized problems. 765-794 - Matteo Lapucci, Giampaolo Liuzzi, Stefano Lucidi, Davide Pucci, Marco Sciandrone:
A globally convergent gradient method with momentum. 795-820 - Henry Kasumba:
A shape optimization approach for a Batchelor flow problem. 821-850 - Juan Pablo Fernández-Gutiérrez, Juan G. Villegas, José-Fernando Camacho-Vallejo:
A simple and effective exact method for the medianoid problem with multipurpose trips. 851-897
Volume 93, Number 3, April 2026
- Albert S. Berahas, Michael J. O'Neill, Clément W. Royer:
A line search framework with restarting for noisy optimization problems. 899-920 - Giampaolo Liuzzi, Stefano Lucidi:
A derivative-free approach to mixed integer constrained multiobjective nonsmooth black-box optimization. 921-966 - Mathias Staudigl, Simon Weissmann, Tristan van Leeuwen:
Derivative-free stochastic bilevel optimization for inverse problems. 967-1020 - Qing-Rui He, Sheng-Jie Li, Ming-Hua Li, Chun-Rong Chen:
A nonlinear conjugate gradient algorithm for multiobjective optimization: multiple hybrid search direction and global rates. 1021-1067 - Yingying Li, Hongwei Liu, Hailong You, Zexian Liu, Fang Zhang:
Multi-objective k-way parallel hypergraph partitioning with proximal gradient algorithm. 1069-1105 - Yan Li, Yu-Hong Dai, Liping Zhang:
New restricted isometry properties of constrained and unconstrained L*-F minimization for low-rank approximation. 1107-1143 - Yining Gu, Yanjun Wang, Zhen Cao, Yicheng Huang:
Distributionally robust optimization problem with probabilistic envelope constraints over Wasserstein ball. 1145-1189 - Ulrich Kohlenbach, Nicholas Pischke:
Quantitative results for a Tseng-type primal-dual method for composite monotone inclusions. 1191-1223 - Zeguan Wu, Xiu Yang, Tamás Terlaky:
A preconditioned inexact infeasible quantum interior point method for linear optimization. 1225-1257 - Gabriel R. S. Grillo, Elias S. Helou, Sandra A. Santos:
Inexact FISTA-like Methods with Adaptive Backtracking. 1259-1304 - Josué D. Díaz-Avalos, Antoine Laurain:
Shape optimization of polytopes and application to the polyhedral Saint-Venant inequality. 1305-1353 - Santanu Soe, Matthew K. Tam, Vellaichamy Vetrivel:
The golden ratio primal-dual algorithm with two new stepsize rules for convex-concave saddle point problems. 1355-1399 - Quoc Tran-Dinh:
Correction to: From Halpern's fixed-point iterations to Nesterov's accelerated interpretations for root-finding problems. 1401-1402
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-05-19 22:23 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:
