[BOOK][B] Interior point approach to linear, quadratic and convex programming: algorithms and complexity
D Den Hertog - 2012 - books.google.com
This book describes the rapidly develo** field of interior point methods (IPMs). An
extensive analysis is given of path-following methods for linear programming, quadratic …
extensive analysis is given of path-following methods for linear programming, quadratic …
An infeasible interior-point algorithm for solving primal and dual geometric programs
In this paper an algorithm is presented for solving the classical posynomial geometric
programming dual pair of problems simultaneously. The approach is by means of a primal …
programming dual pair of problems simultaneously. The approach is by means of a primal …
Posynomial geometric programming with interval exponents and coefficients
ST Liu - European Journal of Operational Research, 2008 - Elsevier
Geometric programming provides a powerful tool for solving nonlinear problems where
nonlinear relations can be well presented by an exponential or power function. In the real …
nonlinear relations can be well presented by an exponential or power function. In the real …
Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993
D Boukari, AV Fiacco - Optimization, 1995 - Taylor & Francis
This paper is an updated and edited version of the survey that appeared in Boukari [42]. The
original work reported on research since the Fiacco-McCormick 1968 survey [95] that has …
original work reported on research since the Fiacco-McCormick 1968 survey [95] that has …
Solving geometric programming problems with triangular and trapezoidal uncertainty distributions
The geometric programming problem is an important optimization technique that is often
used to solve different nonlinear optimization problems and engineering problems. The …
used to solve different nonlinear optimization problems and engineering problems. The …
Posynomial parametric geometric programming with interval valued coefficient
The article presents solution procedure of geometric programming with imprecise
coefficients. We have considered problems with imprecise data as a form of an interval in …
coefficients. We have considered problems with imprecise data as a form of an interval in …
Posynomial geometric programming with parametric uncertainty
ST Liu - European Journal of Operational Research, 2006 - Elsevier
Geometric programming provides a powerful tool for solving nonlinear problems where
nonlinear relations can be well presented by exponential or power function. This paper …
nonlinear relations can be well presented by exponential or power function. This paper …
Geometric Programming Problems with Triangular and Trapezoidal Twofold Uncertainty Distributions
Geometric programming is a well-known optimization tool for dealing with a wide range of
nonlinear optimization and engineering problems. In general, it is assumed that the …
nonlinear optimization and engineering problems. In general, it is assumed that the …
Solving posynomial geometric programming problems via generalized linear programming
This paper revisits an efficient procedure for solving posynomial geometric programming
(GP) problems, which was initially developed by Avriel et al. The procedure, which used the …
(GP) problems, which was initially developed by Avriel et al. The procedure, which used the …
An interior point potential reduction method for constrained equations
We study the problem of solving a constrained system of nonlinear equations by a
combination of the classical damped Newton method for (unconstrained) smooth equations …
combination of the classical damped Newton method for (unconstrained) smooth equations …