Newton's method for optimization problems with a convex smooth surface as a constraint
From MaRDI portal
Publication:2901142
Recommendations
- scientific article; zbMATH DE number 2208686
- An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
- An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
- Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
- Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
Cited in
(10)- Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
- scientific article; zbMATH DE number 3991288 (Why is no real title available?)
- An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
- scientific article; zbMATH DE number 2208686 (Why is no real title available?)
- Newton's method and its use in optimization
- Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set
- An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
- A Newton-bracketing method for a simple conic optimization problem
- Optimal step length for the maximal decrease of a self-concordant function by the Newton method
- Generalization of the Newton method for one class of nonconvex mathematical programming problems
This page was built for publication: Newton's method for optimization problems with a convex smooth surface as a constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901142)
