Calculation method for quadratic programming problem in Hilbert spaces partially ordered by cone with empty interior

DOI10.1501/COMMUA1_0000000694zbMATH Open1327.90160OpenAlexW2917417938MaRDI QIDQ3451981FDOQ3451981

Authors: Feyzullah Ahmetoğlu 

Publication date: 18 November 2015

Published in: Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1501/commua1_0000000694

Recommendations

• A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space
• scientific article; zbMATH DE number 3887443
• Optimality conditions for quadratic programming problems in Hilbert spaces
• Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space
• On the solution existence of convex quadratic programming problems in Hilbert spaces

zbMATH Keywords

convex functionminimization methodKuhn-Tucker conditions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cited In (1)

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

This page was built for publication: Calculation method for quadratic programming problem in Hilbert spaces partially ordered by cone with empty interior

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