Masoud Ahookhosh

Available identifiers

zbMath Open ahookhosh.masoudMaRDI QIDQ369444

List of research outcomes

Publication	Date of Publication	Type
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods	2024-11-07	Paper
Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions	2023-11-14	Paper
Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity	2022-09-29	Paper
Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg-Marquardt methods	2022-09-29	Paper
Block Bregman majorization minimization with extrapolation	2022-03-01	Paper
High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search	2021-09-25	Paper
A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization	2021-08-18	Paper
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization	2021-08-09	Paper
High-order methods beyond the classical complexity bounds, I: inexact high-order proximal-point methods	2021-07-13	Paper
A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima	2021-03-10	Paper
Structural conserved moiety splitting of a stoichiometric matrix	2021-01-13	Paper
Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity	2020-03-11	Paper
On efficiency of nonmonotone Armijo-type line searches	2020-01-15	Paper
Optimal subgradient methods: computational properties for large-scale linear inverse problems	2019-07-31	Paper
Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity	2019-07-10	Paper
An optimal subgradient algorithm with subspace search for costly convex optimization problems	2019-05-23	Paper
A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization	2018-12-07	Paper
On the acceleration of forward-backward splitting via an inexact Newton method	2018-11-07	Paper
Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)	2018-05-24	Paper
Optimal subgradient algorithms for large-scale convex optimization in simple domains	2018-01-12	Paper
A limited memory adaptive trust-region approach for large-scale unconstrained optimization	2017-10-25	Paper
An optimal subgradient algorithm for large-scale bound-constrained convex optimization	2017-10-10	Paper
An improved adaptive trust-region algorithm	2017-04-05	Paper
Accelerated first-order methods for large-scale convex minimization	2016-04-29	Paper
Two globally convergent nonmonotone trust-region methods for unconstrained optimization	2016-02-09	Paper
A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems	2015-11-30	Paper
An inexact line search approach using modified nonmonotone strategy for unconstrained optimization	2014-06-06	Paper
Optimal subgradient algorithms with application to large-scale linear inverse problems	2014-02-28	Paper
An effective trust-region-based approach for symmetric nonlinear systems	2013-10-08	Paper
Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations	2013-09-24	Paper
A class of nonmonotone armijo-type line search method for unconstrained optimization	2012-08-23	Paper
A nonmonotone trust-region line search method for large-scale unconstrained optimization	2012-04-21	Paper
An efficient nonmonotone trust-region method for unconstrained optimization	2012-04-04	Paper
Combination adaptive trust region method by non-monotone strategy for unconstrained nonlinear programming	2011-12-08	Paper
A nonmonotone trust region method with adaptive radius for unconstrained optimization problems	2010-12-14	Paper

Research outcomes over time

This page was built for person: Masoud Ahookhosh