A comparative study on optimization methods for the constrained nonlinear programming problems.
Yeniay, Ozgur (2005)
Mathematical Problems in Engineering
Similarity:
Yeniay, Ozgur (2005)
Mathematical Problems in Engineering
Similarity:
Paweł Białoń (2000)
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Similarity:
A method for solving large convex optimization problems is presented. Such problems usually contain a big linear part and only a small or medium nonlinear part. The parts are tackled using two specialized (and thus efficient) external solvers: purely nonlinear and large-scale linear with a quadratic goal function. The decomposition uses an alteration of projection methods. The construction of the method is based on the zigzagging phenomenon and yields a non-asymptotic convergence, not...
Byrd, Richard H., Nocedal, Jorge (1998)
Documenta Mathematica
Similarity:
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.
Leo Liberti (2009)
RAIRO - Operations Research
Similarity:
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...
Tadeusz Antczak (2007)
Control and Cybernetics
Similarity: