Computing minimum norm solution of a specific constrained convex nonlinear problem

MaRDI QIDQ2893937zbMATH OpenFDO

Authors Saeed Ketabchi, Hossein Moosaei

Publication date 26 June 2012

Published in Kybernetika (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/246216, http://www.kybernetika.cz/content/2012/1/123

zbMATH Keywords

alternative theoremsminimum norm solutionresidual vectorsolution set of convex problems

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• On the minimum-norm solution of convex quadratic programming
• On the solution set of convex problems and its numerical application
• On the minimum norm solution of linear programs
• Iterative approximation of solutions for constrained convex minimization problem
• Minimum norm solution to the positive semidefinite linear complementarity problem

Cites work

• A finite newton method for classification
• A Newton method for linear programming
• A simple characterization of solutions sets of convex programs
• scientific article; zbMATH DE number 2068035 (Why is no real title available?)
• Minimization of functions having Lipschitz continuous first partial derivatives
• On the minimum norm solution of linear programs
• On the solution set of convex problems and its numerical application

Cited in

(4)

• On the minimum norm solution of linear programs
• Solving minimum norm problems using penalty functions and the gradient method
• On the solution set of convex problems and its numerical application
• Minimizing Condition Number via Convex Programming

This page was built for publication: Computing minimum norm solution of a specific constrained convex nonlinear problem

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