Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set
DOI10.1134/S0965542519070054zbMath1437.65050OpenAlexW2967986804MaRDI QIDQ2278194
Publication date: 4 December 2019
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542519070054
convex compact setconvergence of algorithmconvex programming problemsmooth surfacenecessary conditions for local minimumprojection onto a nonconvex set
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A generalization of the gradient projection method to extremal problems with preconvex constraints.
- A regularized continuous linearization method for minimization problems with inexact initial data.
- A two-step linearization method for minimization problems.
- Dual barrier-projection and barrier-Newton methods for linear programming problems.
- Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set
- The gradient projection method with exact line search
- Barrier-projective methods for nonlinear programming
- Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set
- Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint
- A relaxation method for minimizing a smooth function on a generalized spherical segment
- Gradient projection method for stable approximation of quasisolutions to irregular nonlinear operator equations
This page was built for publication: Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set
