Displaying similar documents to “Penalty/barrier path-following in linearly constrained optimization”

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...

Uniform Convergence of the Newton Method for Aubin Continuous Maps

Dontchev, Asen (1996)

Serdica Mathematical Journal

Similarity:

* This work was supported by National Science Foundation grant DMS 9404431. In this paper we prove that the Newton method applied to the generalized equation y ∈ f(x) + F(x) with a C^1 function f and a set-valued map F acting in Banach spaces, is locally convergent uniformly in the parameter y if and only if the map (f +F)^(−1) is Aubin continuous at the reference point. We also show that the Aubin continuity actually implies uniform Q-quadratic convergence provided that...

État de l'art des méthodes “d'optimisation globale”

Gérard Berthiau, Patrick Siarry (2010)

RAIRO - Operations Research

Similarity:

We present a review of the main “global optimization" methods. The paper comprises one introduction and two parts. In the introduction, we recall some generalities about non linear constraint-less optimization and we list some classifications which have been proposed for the global optimization methods. We then describe, in the first part, various “classical" global optimization methods, most of which available long before the appearance of Simulated Annealing (a key event in this...