scientific article; zbMATH DE number 2206826

MaRDI QIDQ5317981zbMATH OpenFDO

Authors E. G. Gol'shteĭn

Publication date 21 September 2005

zbMATH Keywords

Lipschitz conditionmethod of logarithmic barriers

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• scientific article; zbMATH DE number 3910150
• Application of the method of conjugate subgradients to minimization of quasiconvex functions
• Level function method for quasiconvex programming.
• scientific article; zbMATH DE number 5197127
• A method for minimizing a quasiconvex function in a two-dimensional plane without computing derivatives

Cited in

(7)

• A method for minimizing a quasiconvex function in a two-dimensional plane without computing derivatives
• An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
• scientific article; zbMATH DE number 4119961 (Why is no real title available?)
• Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming
• A Barzilai-Borwein type method for minimizing composite functions
• scientific article; zbMATH DE number 1450268 (Why is no real title available?)
• Level function method for quasiconvex programming.

This page was built for publication:

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