Pages that link to "Item:Q522090"
From MaRDI portal
The following pages link to An inexact proximal regularization method for unconstrained optimization (Q522090):
Displaying 15 items.
- Properties of the proximate parameter tuning regularization algorithm (Q977682) (← links)
- A regularized Newton method for degenerate unconstrained optimization problems (Q1926636) (← links)
- Descentwise inexact proximal algorithms for smooth optimization (Q1935582) (← links)
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
- On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
- Inexact version of Bregman proximal gradient algorithm (Q2198034) (← links)
- An inexact and nonmonotone proximal method for smooth unconstrained minimization (Q2252253) (← links)
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
- An inexact Riemannian proximal gradient method (Q2701414) (← links)
- Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems (Q3091242) (← links)
- A Regularized Factorization-Free Method for Equality-Constrained Optimization (Q4641674) (← links)
- A proximal regularization of the steepest descent method (Q4846542) (← links)
- An efficient gradient method with approximately optimal stepsizes based on regularization models for unconstrained optimization (Q5104613) (← links)
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization (Q5244400) (← links)
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
