An infeasible interior-point algorithm for solving primal and dual geometric programs
From MaRDI portal
Publication:1361109
DOI10.1007/BF02614382zbMath0881.90106OpenAlexW2032834460MaRDI QIDQ1361109
Publication date: 23 July 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614382
dualityconvex analysisnumerical implementationposynomial geometric programmingsparse matrix factorizationsinfeasible primal-dual algorithmsubfeasible solutions
Related Items
Tractable approximate robust geometric programming, Geometric programming with fuzzy parameters in engineering optimization, A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty, On generalized geometric programming problems with non-positive variables, Branch-reduction-bound algorithm for generalized geometric programming, A new rectangle branch-and-pruning approach for generalized geometric programming, A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation, Perfect duality in solving geometric programming problems under uncertainty, A new global optimization algorithm for solving generalized geometric programming, Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions, A global optimization using linear relaxation for generalized geometric programming, Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, Solving geometric programming problems with normal, linear and zigzag uncertainty distributions, Geometric programming approach to doping profile design optimization of metal-oxide-semiconductor devices, A global optimization algorithm for signomial geometric programming problem, Global optimization of signomial geometric programming using linear relaxation., Posynomial geometric programming with interval exponents and coefficients, The discrete ellipsoid covering problem: a discrete geometric programming approach, Accelerating method of global optimization for signomial geometric programming, Computing Maximum Likelihood Estimators of Convex Density Functions, Posynomial parametric geometric programming with interval valued coefficient, Linearization method of global optimization for generalized geometric programming, ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods, Global optimization of generalized geometric programming, Temperature-aware floorplanning via geometric programming, Inner approximation algorithm for generalized linear multiplicative programming problems, A tutorial on geometric programming, Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach, Posynomial geometric programming with parametric uncertainty, A deterministic global optimization algorithm for generalized geometric programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stochastic geometric programming problem with multiplicative recourse
- Controlled dual perturbations for posynomial programs
- On some efficient interior point methods for nonlinear convex programming
- Bibliographical note on geometric programming
- Comparison of generalized geometric programming algorithms
- Dual to primal conversion in geometric programming
- The Newton-Cauchy framework. A unified approach to unconstrained nonlinear minimization
- 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
- Global convergence in infeasible-interior-point algorithms
- Restricted multinomial maximum likelihood estimation based upon Fenchel duality
- Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
- Classifying convex extremum problems over linear topologies having separation properties
- On controlling the parameter in the logarithmic barrier term for convex programming problems
- A logarithmic barrier cutting plane method for convex programming
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On meromorphic solutions of a functional equation of Ganapathy Iyer
- Optimal design modifications by geometric programming and constrained stochastic network models
- A set of geometric programming test problems and their solutions
- On a classification scheme for geometric programming and complementarity theorems††
- A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
- Allocation of resources in project management
- Symmetric Quasidefinite Matrices
- A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
- Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity*
- Semi-infinite programming, differentiability and geometric programming: Part II
- Convex Analysis
