Convex Programming by Tangential Approximation
From MaRDI portal
Publication:2778994
DOI10.1287/mnsc.9.4.600zbMath0995.90606OpenAlexW2062010644MaRDI QIDQ2778994
Publication date: 22 October 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.9.4.600
Related Items (9)
Penalty function versus non-penalty function methods for constrained nonlinear programming problems ⋮ Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I) ⋮ Unnamed Item ⋮ Computational aspects of cutting-plane algorithms for geometric programming problems ⋮ Minimization methods with constraints ⋮ The dual of the dual as an approximation of the primal ⋮ Current state of the art of algorithms and computer software for geometric programming ⋮ The distribution of a projected least squares estimator ⋮ Zum heutigen Stand der nichtlinearen Optimierungstheorie
This page was built for publication: Convex Programming by Tangential Approximation
