Active set and interior methods for nonlinear optimization.

Byrd, Richard H.; Nocedal, Jorge

Displaying similar documents to “Active set and interior methods for nonlinear optimization.”

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.

Large-scale nonlinear programming algorithm using projection methods

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

A comparative study on optimization methods for the constrained nonlinear programming problems.

Yeniay, Ozgur (2005)

Mathematical Problems in Engineering

Similarity:

News

(1988)

Kybernetika

Similarity:

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

A duality theorem for complex nonlinear programming

C. Das, J. Parida (1977)

Matematički Vesnik

Similarity:

Saddle points criteria via a second order $η$ -approximation approach for nonlinear mathematical programming involving second order invex functions

Tadeusz Antczak (2011)

Kybernetika

Similarity:

In this paper, by using the second order $η$ -approximation method introduced by Antczak [3], new saddle point results are obtained for a nonlinear mathematical programming problem involving second order invex functions with respect to the same function $η$ . Moreover, a second order $η$ -saddle point and a second order $η$ -Lagrange function are defined for the so-called second order $η$ -approximated optimization problem constructed in this method. Then, the equivalence between an optimal solution...

Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming.

Ram, Balasubramanian, Babu, A.J.G. (1988)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Multi-objective Optimization Problem with Bounded Parameters

Ajay Kumar Bhurjee, Geetanjali Panda (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper, we propose a nonlinear multi-objective optimization problem whose parameters in the objective functions and constraints vary in between some lower and upper bounds. Existence of the efficient solution of this model is studied and gradient based as well as gradient free optimality conditions are derived. The theoretical developments are illustrated through numerical examples.