Article

ALGORITHM FOR ANALYZING THE TARGET FUNCTION OF A NONLINEAR PROGRAMMING PROBLEM TO FIND THE NUMBER OF LOCAL EXTREMA.

January 1977
Automatic Control and Computer Sciences 11(5):39-41

Authors:

An algorithm is described for analyzing a target function f(x//1,. . . . ,x//n) in a nonlinear programming problem in order to find the number of local minima. For analysis, subsets of convexity of the function f(x//1,. . . . ,x//n) are singled out on the set of specification X.

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Collectively compact sets of nonlinear operators in locally convex spaces

November 1978 · Journal of Mathematical Analysis and Applications

Collectively compact sets of (linear) operators in Banach spaces have been studied and used by P. M. Anselone [2] and others in connection with integral operators. In this paper we show that a relevant part of the theory extends to bounded (in general nonlinear) operators in locally convex spaces.

Article

Full-text available

Generalized variational inequalities and fixed point theorems

January 1998 · Nonlinear Analysis

In this paper, from a well-known fixed point theorem of Idzik [l], we deduce new variational inequality for not-necessarily locally convex topological vector spaces and fiied point theorems for generalized upper hemicontinuous multimaps. Consequently, all of the results in Kim and Tan [2], Ding [3], and some others are substantially extended and improved. Moreover, our new fixed point ... [Show full abstract] theorems on generalized upper hemicontinuous multimaps include a large number of historically well-known extensions of the Brouwer or Kakutani theorems.

View full-text

Article

Identification of Nonlinear State-Space Models by Deterministic Search

January 1996

An economical technique for tracing the boundary of a two-dimensional cross section of the feasible parameter set for a model with bounded output error is described. It allows exploration of a boundary which is not piecewise linear and may not be convex. First a point on the boundary is found, then a line search is executed, adapting to local behavior of the boundary. Resolution may be traded ... [Show full abstract] against computational speed by choice of the search parameters.

Article

Full-text available

Fixed points and eigenvalues for countably asymptotically Φ-nonexpansive operators on convex sets un...

December 2020 · Journal of Fixed Point Theory and Applications

The purpose of this paper is to prove fixed point results for certain types of countably asymptotically Φ-nonexpansive (or countably Φ-condensing) operators on locally convex spaces and satisfying additional asymptotic contractive-type conditions. These results allow us to obtain generalizations of recent fixed point theorems of Ben Amar, Isac, Németh, O’Regan, and Touati to locally convex ... [Show full abstract] spaces. As an application, we obtain the existence of positive eigenvalues of countably asymptotically Φ-nonexpansive (or countably Φ-condensing) operators in locally convex spaces. Also, we present Krasnosel’skii fixed point theorems of two nonlinear operators acting on locally convex spaces. These results are based on a generalized notion of the semi-inner product in Lumer’s sense and the axiomatic measure of noncompactness.

View full-text

Article

Full-text available

The distance function in the presence of an obstacle

February 2022 · Calculus of Variations and Partial Differential Equations

We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a fractional modulus of order one half and that, near the obstacle, this regularity is optimal. Then, in the Euclidean setting, we prove that the singularities ... [Show full abstract] of the distance function propagate, in the sense that each singular point belongs to a nontrivial singular continuum. Finally, we investigate the lack of differentiability of the distance function when a convex obstacle is present.

View full-text

Article

Optimality conditions and duality for nonlinear programming problems involving locally (H p ,r,α)-pr...

January 2007 · International Journal of Pure and Applied Mathematics

We introduce new types of generalized convex functions and sets which are called locally (H p ,r,α)-pre-invex functions and locally H p -invex sets, respectively. Some properties of these new classes of functions and sets are established. We also obtain necessary optimality conditions, sufficient optimality conditions and duality theorems for nonlinear programming problems introducing new ... [Show full abstract] concepts of generalized differential and gradient sets of functions. Furthermore, we give some examples to illustrate that the new generalized convexity is an extension of some generalized convexities introduced in literature.

Preprint

Around the nonlinear Ryll-Nardzewski theorem

March 2019

Andrzej Wiśnicki

Suppose that $Q$ is a weak$^{\ast }$ compact convex subset of a dual Banach space with the Radon-Nikod\'{y}m property. We show that if $(S,Q)$ is a nonexpansive and norm-distal dynamical system, then there is a fixed point of $S$ in $Q$ and the set of fixed points is a nonexpansive retract of $Q.$ As a consequence we obtain a nonlinear extension of the Bader-Gelander-Monod theorem concerning ... [Show full abstract] isometries in $L$-embedded Banach spaces. A similar statement is proved for weakly compact convex subsets of a locally convex space, thus giving the nonlinear counterpart of the Ryll-Nardzewski theorem.

Article

A Note on Function Whose Local Minima are Global

March 1982 · Journal of Optimization Theory and Applications

R. Horst

In this note, we introduce a new class of generalized convex functions and show that a real functionf which is continuous on a compact convex subsetM of n and whose set of global minimizers onM is arcwise-connected has the property that every local minimum is global if, and only if,f belongs to that class of functions.

Article

Full-text available

A nonlinear Lagrangian based on Fischer-Burmeister NCP function

May 2007 · Applied Mathematics and Computation

This paper proposes a nonlinear Lagrangian Based on Fischer-Burmeister NCP function for solving nonlinear programming problems with inequality constraints. The convergence theorem shows that the sequence of points generated by this nonlinear Lagrange algorithm is locally convergent when the penalty parameter is less than a threshold under a set of suitable conditions on problem functions, and the ... [Show full abstract] error bound of solution, depending on the penalty parameter, is also established. Moreover, the paper develops the dual approach associated with the proposed nonlinear Lagrangian, in which the related duality theorem is demonstrated. Furthermore, it is shown that the condition number of the nonlinear Lagrangian Hessian at the optimal solution is proportional to the controlling penalty parameter. Numerical results for solving several nonlinear programming problems are reported, showing that the new nonlinear Lagrangian is superior over other known nonlinear Lagrangians for solving some nonlinear programming problems.

View full-text

Article

A class of nonlinear lagrangians: theory and algorithm

June 2008

This paper establishes a theory framework of a class of nonlinear Lagrangians for solving nonlinear programming problems with inequality constraints. A set of conditions are proposed to guarantee the convergence of nonlinear Lagrangian algorithms, to analyze condition numbers of nonlinear Lagrangian Hessians as well as to develop the dual approaches. These conditions are satisfied by well-known ... [Show full abstract] nonlinear Lagrangians appearing in literature. The convergence theorem shows that the dual algorithm based on any nonlinear Lagrangian in the class is locally convergent when the penalty parameter is less than a threshold under a set of suitable conditions on problem functions and the error bound solution, depending on the penalty parameter, is also established. The paper also develops the dual problems based on the proposed nonlinear Lagrangians, and the related duality theorem and saddle point theorem are demonstrated. Furthermore, it is shown that the condition numbers of Lagrangian Hessians at optimal solutions are proportional to the controlling penalty parameters. We report some numerical results obtained by using nonlinear Lagrangians.

Article

The rule of Lagrange multipliers in locally convex spaces

July 1982 · Siberian Mathematical Journal

M. F. Sukhinin

Article

Nonlinear Lagrangians for Nonlinear Programming Based on Modified Fischer-Burmeister NCP Function

July 2015 · Journal of Computational Mathematics

This paper proposes nonlinear Lagrangians based on modified Fischer-Burmeister NCP functions for solving nonlinear programming problems with inequality constraints. The convergence theorem shows that the sequence of points generated by this nonlinear La grange algorithm is locally convergent when the penalty parameter is less than a threshold under a set of suitable conditions on problem ... [Show full abstract] functions, and the error bound of solution, depending on the penalty parameter, is also established. It is shown that the condition number of the nonlinear Lagrangian Hessian at the optimal solution is proportional to the controlling penalty parameter. Moreover, the paper develops the dual algorithm associated with the proposed nonlinear Lagrangians. Numerical results reported suggest that the dual algorithm based on proposed nonlinear Lagrangians is effective for solving some nonlinear optimization problems.

ALGORITHM FOR ANALYZING THE TARGET FUNCTION OF A NONLINEAR PROGRAMMING PROBLEM TO FIND THE NUMBER OF LOCAL EXTREMA.

Abstract

No full-text available

Recommended publications

Collectively compact sets of nonlinear operators in locally convex spaces

Generalized variational inequalities and fixed point theorems

Identification of Nonlinear State-Space Models by Deterministic Search

Fixed points and eigenvalues for countably asymptotically Φ-nonexpansive operators on convex sets un...

The distance function in the presence of an obstacle

Optimality conditions and duality for nonlinear programming problems involving locally (H p ,r,α)-pr...

Around the nonlinear Ryll-Nardzewski theorem

A Note on Function Whose Local Minima are Global

A nonlinear Lagrangian based on Fischer-Burmeister NCP function

A class of nonlinear lagrangians: theory and algorithm

The rule of Lagrange multipliers in locally convex spaces

Nonlinear Lagrangians for Nonlinear Programming Based on Modified Fischer-Burmeister NCP Function