A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space

DOI10.1007/BF01097069zbMath0666.90086OpenAlexW2012196555MaRDI QIDQ1117147

A. N. Moloshnyuk, V. S. Izhutkin

Publication date: 1988

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01097069

zbMATH Keywords

Hilbert spacedescent methodinequality constraintsconvex minimization

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) Methods of successive quadratic programming type (90C55)

Cites Work

• Dualität beim richtungssuchproblem von zoutendijk
• Sufficient conditions for extremum, penalty functions and regularity

This page was built for publication: A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space