Dynamic Proximal Point Method for Unconstrained Minimization (Q7284597)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic Proximal Point Method for Unconstrained Minimization |
No description defined |
Statements
Dynamic Proximal Point Method for Unconstrained Minimization (English)
0 references
4 August 2026
0 references
math.OC
0 references
math.NA
0 references
Enrico Bertolazzi
0 references
Alberto De Marchi
0 references
Davide Stocco
0 references
We propose a dynamic proximal point algorithm that combines adaptive regularization with an inner Newton's method and line search to accelerate unconstrained minimization; we derive the reduced linear system, merit function, and provide practical approaches for constructing the diagonal scaling matrix from derivative information.
0 references
Proximal Point
0 references
Newton's Method
0 references
Unconstrained Minimization
0 references
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
