On the central path for nonlinear semidefinite programming
L. M. Graña Drummond, Alfredo Noel Iusem, B. F. Svaiter (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
L. M. Graña Drummond, Alfredo Noel Iusem, B. F. Svaiter (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
C. Das, J. Parida (1977)
Matematički Vesnik
Similarity:
Ram, Balasubramanian, Babu, A.J.G. (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Emina Krčmar-Nožić (1991)
The Yugoslav Journal of Operations Research
Similarity:
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.
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...
Tadeusz Antczak (2007)
Control and Cybernetics
Similarity:
G. Cioni, A. Miola (1988)
Banach Center Publications
Similarity: