The following pages link to Masoud Ahookhosh (Q369444):
Displayed 34 items.
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations (Q369446) (← links)
- An efficient nonmonotone trust-region method for unconstrained optimization (Q411524) (← links)
- An improved adaptive trust-region algorithm (Q519772) (← links)
- A nonmonotone trust region method with adaptive radius for unconstrained optimization problems (Q611316) (← links)
- Structural conserved moiety splitting of a stoichiometric matrix (Q827814) (← links)
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization (Q1630201) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
- Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity (Q2305550) (← links)
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
- A limited memory adaptive trust-region approach for large-scale unconstrained optimization (Q2412106) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
- A nonmonotone trust-region line search method for large-scale unconstrained optimization (Q2428900) (← links)
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization (Q2453471) (← links)
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization (Q2634354) (← links)
- An effective trust-region-based approach for symmetric nonlinear systems (Q2852125) (← links)
- A class of nonmonotone Armijo-type line search method for unconstrained optimization (Q2903129) (← links)
- COMBINATION ADAPTIVE TRUST REGION METHOD BY NON-MONOTONE STRATEGY FOR UNCONSTRAINED NONLINEAR PROGRAMMING (Q3103654) (← links)
- A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems (Q3453778) (← links)
- Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
- Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods (Q5038173) (← links)
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
- Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions (Q6090288) (← links)
- Optimal subgradient algorithms with application to large-scale linear inverse problems (Q6249411) (← links)
- Accelerated first-order methods for large-scale convex minimization (Q6273023) (← links)
- On the acceleration of forward-backward splitting via an inexact Newton method (Q6309352) (← links)
- High-order methods beyond the classical complexity bounds, I: inexact high-order proximal-point methods (Q6372654) (← links)
- High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search (Q6378558) (← links)