Displaying similar documents to “On the central path for nonlinear semidefinite programming”

Duality theorems for a class of non-linear programming problems.

Shyam S. Chadha (1988)

Trabajos de Investigación Operativa

Similarity:

Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.

A second order η -approximation method for constrained optimization problems involving second order invex functions

Tadeusz Antczak (2009)

Applications of Mathematics

Similarity:

A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order η -approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order η -approximation of both the objective function and the constraint function constituting the original problem. The equivalence between...

Nonsmooth equation method for nonlinear nonconvex optimization

Lukšan, Ladislav, Matonoha, Ctirad, Vlček, Jan

Similarity:

The contribution deals with the description of two nonsmooth equation methods for inequality constrained mathematical programming problems. Three algorithms are presented and their efficiency is demonstrated by numerical experiments.