Orthogonalizing linear operators in convex programming. I, II

DOI10.1007/BF02667194MaRDI QIDQ1280891zbMATH OpenFDO

Authors K. Appert, P. I. Stetsyuk

Publication date 28 April 1999

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

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

zbMATH Keywords

convex functionconvex optimizationFejer-type subgradient methodsone-rank linear operatorsspace transformationssubgradient method

Mathematics Subject Classification ID

Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56)

Recommendations

• Method of orthogonal simplexes and its applications to convex programming
• Operator approach for orthogonality in linear spaces
• Orthogonal least squares solutions for linear operators
• Linear optimization over homogeneous matrix cones
• Optimization of \(c\)-orthogonal posynomials
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• A study of orthogonality of bounded linear operators
• Optimization theory in linear spaces. I
• On the convex programming approach to linear programming
• scientific article; zbMATH DE number 3932310

Cites work

• r-algorithms and ellipsoids
• A modified orthogonal-descent algorithm for finding the zero of a complex function
• A Rapidly Convergent Descent Method for Minimization
• scientific article; zbMATH DE number 3830713 (Why is no real title available?)
• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 3493797 (Why is no real title available?)
• scientific article; zbMATH DE number 3557512 (Why is no real title available?)
• scientific article; zbMATH DE number 3804766 (Why is no real title available?)
• scientific article; zbMATH DE number 3273434 (Why is no real title available?)
• scientific article; zbMATH DE number 3385445 (Why is no real title available?)
• Method of orthogonal descent
• Numerical analysis of the orthogonal descent method
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Variable Metric Method for Minimization

Cited in

(3)

• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• On N. Z. Shor's three scientific ideas

This page was built for publication: Orthogonalizing linear operators in convex programming. I, II

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