A base reduction method for convex programming

DOI10.1016/0893-9659(89)90116-XzbMath0704.90070OpenAlexW2081669604MaRDI QIDQ917445

João J. S. Sentieiro

Publication date: 1989

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90116-x

zbMATH Keywords

inner approximation algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• A feasible direction algorithm for convex optimization: Global convergence rates
• Integrals which are convex functionals. II
• An Efficient Computational Procedure for a Generalized Quadratic Programming Problem

This page was built for publication: A base reduction method for convex programming