Controlled dual perturbations for central path trajectories in geometric programming
From MaRDI portal
Publication:1328646
DOI10.1016/0377-2217(94)90248-8zbMATH Open0808.90112OpenAlexW1971127223MaRDI QIDQ1328646FDOQ1328646
Authors: 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
Recommendations
- Controlled dual perturbations for posynomial programs
- Controlled dual perturbations for l p -programming
- On the central paths and Cauchy trajectories in semidefinite programming
- On duality in some problems of geometric control
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- Inexact Central Path Following Algorithms for Optimal Control Problems
- A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
- A geometric approach to a class of optimal control problems
- Controlled perturbations for quadratically constrained quadratic programs
- On dual dynamic programming in shape control
Cites Work
- Title not available (Why is that?)
- On some efficient interior point methods for nonlinear convex programming
- A path following algorithm for a class of convex programming problems
- Path-Following Methods for Linear Programming
- Current state of the art of algorithms and computer software for geometric programming
- Title not available (Why is that?)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems
- Superlinear primal-dual affine scaling algorithms for LCP
- A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Controlled dual perturbations for posynomial programs
- A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
- On controlling the parameter in the logarithmic barrier term for convex programming problems
Cited In (7)
- Multiobjective geometric programming problem under uncertainty
- Controlled dual perturbations for posynomial programs
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Posynomial parametric geometric programming with interval valued coefficient
- Solving geometric programming problems with normal, linear and zigzag uncertainty distributions
- Posynomial geometric programming with parametric uncertainty
- Controlled dual perturbations for l p -programming
This page was built for publication: Controlled dual perturbations for central path trajectories in geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328646)