Convex programming by tangential approximation

DOI10.1287/MNSC.9.4.600MaRDI QIDQ2778994zbMATH OpenOpenAlexFDO

Authors H. O. Hartley, Ronald R. Hocking

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

Mathematics Subject Classification ID

Convex programming (90C25)

Cited in

(9)

• Minimization methods with constraints
• Current state of the art of algorithms and computer software for geometric programming
• The distribution of a projected least squares estimator
• Computational aspects of cutting-plane algorithms for geometric programming problems
• The dual of the dual as an approximation of the primal
• Zum heutigen Stand der nichtlinearen Optimierungstheorie
• scientific article; zbMATH DE number 3272790 (Why is no real title available?)
• Penalty function versus non-penalty function methods for constrained nonlinear programming problems
• Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I)

This page was built for publication: Convex programming by tangential approximation

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