scientific article; zbMATH DE number 1744789

MaRDI QIDQ4531689zbMATH OpenFDO

Authors Natalia Boal, A. I. Allueva

Publication date 23 May 2002

zbMATH Keywords

geometric programminginterior point methodKKT optimality conditionsmonotonous complementarity problempolynomial model

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51) Methods of quasi-Newton type (90C53)

Recommendations

• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Infeasible interior-point algorithm based optimization method for geometric programming
• scientific article; zbMATH DE number 1744779
• A new algorithm for geometric programming based on the linear structure of its dual problem.
• On a homogeneous algorithm for the monotone complementarity problem

Cited in

(4)

• A computational study of the homogeneous algorithm for large-scale convex optimization
• Transbilayer pores induced by thickness fluctuations
• Infeasible interior-point algorithm based optimization method for geometric programming
• The immersed molecular finite element method

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 Q4531689)