A relaxation method for minimizing a smooth function on a generalized spherical segment

DOI10.1134/S0965542514020043zbMATH Open1313.65164MaRDI QIDQ2940367FDOQ2940367

A. M. Dulliev

Publication date: 26 January 2015

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

convergenceLipschitz conditiongradient projection methodrelaxation methodspherical segmentnonconvex optimization problemtangential cone

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Iterative algorithm for mathematical programming problems with preconvex constraints
• Title not available (Why is that?)
• A generalization of the gradient projection method to extremal problems with preconvex constraints.

Cited In (6)

• 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)