A note on ``Extended univariate algorithms by J. Pinter

DOI10.1007/BF02259098MaRDI QIDQ1114347zbMATH OpenOpenAlexFDO

Authors Antanas Žilinskas

Publication date 1989

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02259098

zbMATH Keywords

convergencecounterexampleextended univariate algorithmsmultiextremal optimization

Mathematics Subject Classification ID

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

Review text

The paper comments on a paper by the reviewer [ibid. 36, 91-103 (1986; Zbl 0572.65047)]. Namely, it is stated that the main result (Theorem 1) of the paper cited is not true. The counterexample given by the present paper is false, as it is based on a misinterpretation of Theorem 1. The fallacy of his argumentation is pointed out in a reply note which was recently submitted to ``Computing.

Recommendations

• scientific article; zbMATH DE number 4102389
• Comment on a result by Alpin, Chien, and Yeh
• A comment on ``Level set algorithm for solving convex multiplicative programming problems
• Correction to: ``Approximations and generalized Newton methods
• Note on ``A new equivalent transformation for interval inequality constraints of interval linear programming

Cites work

• Extended univariate algorithms for n-dimensional global optimization

This page was built for publication: A note on ``Extended univariate algorithms by J. Pinter

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