A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
From MaRDI portal
Publication:4327894
DOI10.1080/02331939208843767zbMath0817.90083OpenAlexW1969481063MaRDI QIDQ4327894
No author found.
Publication date: 7 August 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843767
Related Items
Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Controlled dual perturbations for central path trajectories in geometric programming, On controlling the parameter in the logarithmic barrier term for convex programming problems, An infeasible interior-point algorithm for solving primal and dual geometric programs, A logarithmic barrier cutting plane method for convex programming, Perfect duality in solving geometric programming problems under uncertainty, Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions, Solving geometric programming problems with normal, linear and zigzag uncertainty distributions, Posynomial geometric programming with interval exponents and coefficients, Posynomial parametric geometric programming with interval valued coefficient, An interior point potential reduction method for constrained equations, Investigation of path-following algorithms for signomial geometric programming problems, Posynomial geometric programming with parametric uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The role of duality in optimization problems involving entropy functionals with applications to information theory
- Convergence results and numerical experiments on a linear programming hybrid algorithm
- An algorithm for maximizing entropy subject to simple bounds
- Entropic means
- On equating the difference between optimal and marginal values of general convex programs
- On some efficient interior point methods for nonlinear convex programming
- Bibliographical note on geometric programming
- Comparison of generalized geometric programming algorithms
- Current state of the art of algorithms and computer software for geometric programming
- Dual to primal conversion in geometric programming
- A comparison of computational strategies for geometric programs
- A modified convace simplex algorithm for geometric programming
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Second order algorithms for the posynomial geometric programming dual, part I: Analysis
- A Dual Approach to Multidimensional $L_p$ Spectral Estimation Problems
- On solving a primal geometric program by partial dual optimization
- A set of geometric programming test problems and their solutions
- On a classification scheme for geometric programming and complementarity theorems††
- A simple Duality Proof for Quadratically Constrained Entropy Functionals and Extension to Convex Constraints
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Convex Analysis
