scientific article; zbMATH DE number 2208686
From MaRDI portal
Publication:5691973
Recommendations
- Newton's method for optimization problems with a convex smooth surface as a constraint
- An iterative method for minimizing a convex nonsmooth function on a convex 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
- A gradient projection method on an embedding of the feasible set
- Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
Cited in
(9)- Newton's method for optimization problems with a convex smooth surface as a constraint
- Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint
- Optimality of two-parameter iterative processes in the constrained gradient method
- Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
- An iterative method for minimizing a convex nonsmooth function on a convex smooth surface
- A relaxation method for minimizing a smooth function on a generalized spherical segment
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
- Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface
- An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691973)
