Displaying similar documents to “Large-scale nonlinear programming algorithm using projection methods”

Nonlinear multiple hybrid procedures for solving some constrained nonlinear optimization problems

B. Rhanizar (2002)

Applicationes Mathematicae

Similarity:

We introduce a new formulation of multiple hybrid procedures which consist in a combination of k arbitrary approximate solutions. The connection between this method and other vector sequence transformations is studied. This connection is also exploited for solving some constrained nonlinear optimization problems. A convergence acceleration result is established and numerical examples are given.

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.

Nonlinear Rescaling Method and Self-concordant Functions

Richard Andrášik (2013)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

Nonlinear rescaling is a tool for solving large-scale nonlinear programming problems. The primal-dual nonlinear rescaling method was used to solve two quadratic programming problems with quadratic constraints. Based on the performance of primal-dual nonlinear rescaling method on testing problems, the conclusions about setting up the parameters are made. Next, the connection between nonlinear rescaling methods and self-concordant functions is discussed and modified logarithmic barrier...