Numerical algorithm for solving a class of optimization problems with a constraint in the form of a subset of points of a smooth surface

DOI10.1134/S0965542522120077OpenAlexW4315434487MaRDI QIDQ2679082FDOQ2679082

Authors: Yanyan Li 

Publication date: 19 January 2023

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

Full work available at URL: https://doi.org/10.1134/s0965542522120077

zbMATH Keywords

convergence of algorithmconvex programming problemsmooth surfacenecessary conditions for local minimumopen convex set

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Linear convergence analysis of the use of gradient projection methods on total variation problems
• Stable gradient projection method for nonlinear conditionally well-posed inverse problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gradient projection and conditional gradient methods for constrained nonconvex minimization
• Generalized memory gradient projection method for non-linear programming with non-linear equality and in-equality constraints
• Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed 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
• Some continuous methods for solving quasi-variational inequalities
• A regularized continuous extragradient method of the first order with a variable metric for problems of equilibrium programming
• Solution of ill-posed nonconvex optimization problems with accuracy proportional to the error in input data
• Algorithms for projecting a point onto a level surface of a continuous function on a compact set
• A two-step regularized linearization method for solving minimization problems.
• Numerical algorithm for solving mathematical programming problems with a smooth surface as a constraint
• Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set
• On the gradient projection method for weakly convex functions on a proximally smooth set
• Gradient projection method on matrix manifolds

Cited In (1)

• Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface

This page was built for publication: Numerical algorithm for solving a class of optimization problems with a constraint in the form of a subset of points of a smooth surface

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679082)