Minimization of certain cost functions with error bounds

DOI10.1016/S0168-9274(97)00003-2MaRDI QIDQ1356989zbMATH OpenOpenAlexFDO

Authors Byron Drachman

Publication date 8 January 1998

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0168-9274(97)00003-2

zbMATH Keywords

cost minimizationerror boundsgeometric programmingNewton's method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Review text

Using Newton's method to find the minimum cost of a geometric programming problem it is shown that the proof of the duality theorem allows one to determine error bounds for the minimum cost.

Recommendations

• Robustness of posynomial geometric programming optima
• scientific article; zbMATH DE number 3971598
• Duality inequalities as a numerical aid
• scientific article; zbMATH DE number 3876494
• Duality for minmax programs

Cites work

• Cost Minimization Problems Treated by Geometric Means
• Dual Programs and Minimum Cost
• scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• scientific article; zbMATH DE number 193053 (Why is no real title available?)

Cited in

(4)

• Minimally supported error representations and approximation by the constants
• Error bounds for a near-minimax approximation
• Rates of minimization of error functionals over Boolean variable-basis functions
• Minimizing robust estimates of sums of parameterized functions

This page was built for publication: Minimization of certain cost functions with error bounds

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