A relaxation method for minimizing a smooth function on a generalized spherical segment
From MaRDI portal
Publication:2940367
Recommendations
- Successive relaxation method for minimization of functionals and some efficiency estimates
- Methods of minimization of functions on a sphere and their applications
- scientific article; zbMATH DE number 2000794
- Publication:3199196
- Application of the method of conjugate subgradients to minimization of quasiconvex functions
Cites work
- scientific article; zbMATH DE number 7092134 (Why is no real title available?)
- scientific article; zbMATH DE number 2208686 (Why is no real title available?)
- scientific article; zbMATH DE number 2210690 (Why is no real title available?)
- A generalization of the gradient projection method to extremal problems with preconvex constraints.
- Iterative algorithm for mathematical programming problems with preconvex constraints
Cited in
(7)- Methods of minimization of functions on a sphere and their applications
- Minimization of a smooth function on the boundary of an outer generalized spherical segment
- A Lagrangian Relaxation for Golomb Rulers
- Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set
- Nearly optimal coverings of a sphere with generalized spherical segments
- 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 extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
This page was built for publication: A relaxation method for minimizing a smooth function on a generalized spherical segment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940367)