A new global optimization algorithm for solving generalized geometric programming.

Liu, San-Yang; Wang, Chun-Feng; Liu, Li-Xia

Displaying similar documents to “A new global optimization algorithm for solving generalized geometric programming.”

Global optimization for sum of linear ratios problem using new pruning technique.

Jiao, Hongwei, Feng, Qigao, Shen, Peiping, Guo, Yunrui (2008)

Mathematical Problems in Engineering

Similarity:

Inexact solution of auxiliary problems in Polyak type algorithms

Zdeněk Dostál (1999)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

The second-order methods in discrete optimal control problems

Jiří V. Outrata (1976)

Kybernetika

Similarity:

New algorithms for maximization of concave functions with box constraints

A. Friedlander, J. M. Martinez (1992)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A trust region method for zero-one nonlinear programming

D. Mauricio, N. Maculan (1997)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A numerical feasible interior point method for linear semidefinite programs

Djamel Benterki, Jean-Pierre Crouzeix, Bachir Merikhi (2007)

RAIRO - Operations Research

Similarity:

This paper presents a feasible primal algorithm for linear semidefinite programming. The algorithm starts with a strictly feasible solution, but in case where no such a solution is known, an application of the algorithm to an associate problem allows to obtain one. Finally, we present some numerical experiments which show that the algorithm works properly.