scientific article; zbMATH DE number 447429

MaRDI QIDQ3142885zbMATH OpenFDO

Authors Andrzej Cegielski

Publication date 15 November 1993

zbMATH Keywords

acute conesconvergenceconvex optimizationdescent methodsMarkov subgradientnumerical testsprojection methodsrelaxation methodsresearch monographtextbook

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 195045
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
• The projected subgradient algorithm in convex optimization
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
• Convex optimization algorithms

Cited in

(8)

• Best ellipsoidal relaxation to solve a nonconvex problem.
• The relaxation-penalty method and degenerate extremal problems.
• Geometrically convergent projection method in matrix games
• The relaxation method for certain type of pseudoconvex programming problems
• Opial-type theorems and the common fixed point problem
• Projection methods for the linear split feasibility problems
• scientific article; zbMATH DE number 195139 (Why is no real title available?)
• Obtuse cones and Gram matrices with non-negative inverse

This page was built for publication:

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