Orthogonalizing linear operators in convex programming. I, II

DOI10.1007/BF02667194zbMath0980.90066MaRDI QIDQ1280891

K. Appert

Publication date: 28 April 1999

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

zbMATH Keywords

convex optimizationsubgradient methodconvex functionFejer-type subgradient methodsone-rank linear operatorsspace transformations

Mathematics Subject Classification ID

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

Related Items (2)

On N. Z. Shor's three scientific ideas ⋮ Modified \(r\)-algorithm to find the global minimum of polynomial functions

Cites Work

• A modified orthogonal-descent algorithm for finding the zero of a complex function
• \(r\)-algorithms and ellipsoids
• Numerical analysis of the orthogonal descent method
• Variable Metric Method for Minimization
• Method of orthogonal descent
• A Rapidly Convergent Descent Method for Minimization
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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