Displaying similar documents to “On a classification of stationary points in nonlinear programming”

Two minimax-type methods for solving systems of nonlinear equations

Jaroslav Hrouda (1969)

Aplikace matematiky

Similarity:

The system of equations h i ( x ) = 0 ( i = 1 , ... , r ; x ∈ E n ) is solved by means of iterative methods of minimization of the functions A) m a x i h i ( x ) under the conditions h i ( x ) ≥ 0 , B) m a x i h i ( x ) . These methods are derived from the Zoutendijk’s method of feasible directions. A good deal of attention is paid to their numerical aspects.

First- and second-order optimality conditions for mathematical programs with vanishing constraints

Tim Hoheisel, Christian Kanzow (2007)

Applications of Mathematics

Similarity:

We consider a special class of optimization problems that we call Mathematical Programs with Vanishing Constraints, MPVC for short, which serves as a unified framework for several applications in structural and topology optimization. Since an MPVC most often violates stronger standard constraint qualification, first-order necessary optimality conditions, weaker than the standard KKT-conditions, were recently investigated in depth. This paper enlarges the set of optimality criteria...