A Parametric Newton Method for Optimization Problems in Hilbert Spaces
From MaRDI portal
The purpose of this paper is to modify the Newton method for solving minimization problems avoiding the calculation of the inverse operators in infinite-dimensional spaces. The paper deals with a parametric optimization problem in real Hilbert spaces, assuming that the gradient of the cost functional is Lipschitz continuous. The supergeometric rate of convergence is obtained as well as the monotonicity of the minimizing sequence. Two examples are considered (briefly).
Recommendations
Cites work
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
- A nonsmooth version of Newton's method
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convergence of Newton's Method for Singular Smooth and Nonsmooth Equations Using Adaptive Outer Inverses
- Convergence of Newton-like methods for singular operator equations using outer inverses
- Error bounds for euler approximation of a state and control constrained optimal control problem1
- Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search
- Globally Convergent Newton Methods for Nonsmooth Equations
- scientific article; zbMATH DE number 54277 (Why is no real title available?)
- scientific article; zbMATH DE number 3539341 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Inner, outer, and generalized inverses in banach and hilbert spaces
- New extremal characterizations of generalized inverse of linear operators
- Newton's method for a class of nonsmooth functions
- Nonsmooth Equations: Motivation and Algorithms
- On quantitative stability in optimization and optimal control
- On second-order subdifferentials and their applications
- Optimization and nonsmooth analysis
- Parametric lyapunov function method for solving nonlinear systems in hilbert spaces
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Uniform convergence and mesh independence of Newton's method for discretized variational problems
- Variational analysis
Cited in
(10)- A dynamical system associated with Newton's method for parametric approximations of convex minimization problems
- scientific article; zbMATH DE number 3950227 (Why is no real title available?)
- scientific article; zbMATH DE number 29642 (Why is no real title available?)
- scientific article; zbMATH DE number 1774963 (Why is no real title available?)
- A proximal-Newton method for unconstrained convex optimization in Hilbert spaces
- scientific article; zbMATH DE number 2158987 (Why is no real title available?)
- Logarithmic-barrier decomposition interior-point methods for stochastic linear optimization in a Hilbert space
- Parametric method for global optimization
- Parametric proximal-point methods
- A parametrized Newton method for nonsmooth equations with finitely many maximum functions
This page was built for publication: A Parametric Newton Method for Optimization Problems in Hilbert Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412380)