Controlled dual perturbations for central path trajectories in geometric programming

DOI10.1016/0377-2217(94)90248-8zbMath0808.90112OpenAlexW1971127223MaRDI QIDQ1328646

V. Pereyra

Publication date: 15 March 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90248-8

zbMATH Keywords

duality gapprimal-dual algorithmposynomial geometric programmingdynamic perturbation algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (5)

An infeasible interior-point algorithm for solving primal and dual geometric programs ⋮ Solving geometric programming problems with normal, linear and zigzag uncertainty distributions ⋮ Posynomial parametric geometric programming with interval valued coefficient ⋮ Unnamed Item ⋮ Posynomial geometric programming with parametric uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Controlled dual perturbations for posynomial programs
• On some efficient interior point methods for nonlinear convex programming
• Current state of the art of algorithms and computer software for geometric programming
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• On controlling the parameter in the logarithmic barrier term for convex programming problems
• Superlinear primal-dual affine scaling algorithms for LCP
• A path following algorithm for a class of convex programming problems
• Path-Following Methods for Linear Programming
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
• A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems

This page was built for publication: Controlled dual perturbations for central path trajectories in geometric programming