Results 111 to 120 of about 148 (137)
Some of the next articles are maybe not open access.

Evenly Quasiconvex Functions

2020
This chapter is devoted to the study of those functions whose lower level sets are evenly convex, the so-called evenly quasiconvex functions. In Sect. 3.1 we define this class of functions, which provides greater minorants than the smaller class of the lower semicontinuous quasiconvex functions.
María D. Fajardo   +3 more
openaire   +1 more source

On extremal points of quasiconvex functions

Mathematical Programming, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Quadratic Programming with a Quasiconvex Objective Function

Operations Research, 1971
This paper gives both necessary and sufficient conditions for a quadratic function to be quasiconvex in the nonnegative orthant. Methods of pseudoconvex programming (such as those of Frank and Wolfe) can solve linearly constrained quadratic programming problems with such an objective function.
openaire   +2 more sources

Functions With Quasiconvex Derivatives

1998
The necessary and sufficient conditions for quasiconvexity are given for the derivative of real-valued function, defined and continuously differentiate on I = [a, b] ⊂ ℝ Also, some inequalities are presented in this paper.
Vidan Govedarica, Milan Jovanović
openaire   +1 more source

On Generalized Pseudo- and Quasiconvexities for Nonsmooth Functions

2018
Convexity is the most important and useful concept in mathematical optimization theory. In order to extend the existing results depending on convexity, numerous attempts of generalizing the concept have been published during years. Different types of generalized convexities have proved to be the main tool when constructing optimality conditions, in ...
Mäkelä Marko   +2 more
openaire   +2 more sources

Minimization of Quasiconvex Functions

2020
In this chapter we study minimization of a quasiconvex function. Our algorithm has two steps. In each of these two steps there is a computational error. In general, these two computational errors are different. We show that our algorithm generates a good approximate solution, if all the computational errors are bounded from above by a small positive ...
openaire   +1 more source

New examples of quasiconvex functions

Archive for Rational Mechanics and Analysis, 1992
Let \({\mathcal S}_ n\) denote the space of all symmetric \(n\times n\) matrices and let \({\mathcal O}_ l\) be the subset of the regular matrices with index \(l\), \(0\leq l\leq n\). The author proves that the functions \(F_ l: {\mathcal S}_ n\to {\mathcal R}\) defined by \[ F_ l(X)= \begin{cases} |\text{det } X|\quad & \text{if }X\in {\mathcal O}_ l\\
openaire   +1 more source

Quasidifferentiability of nonsmooth quasiconvex functions

Optimization, 1993
The paper deals with nonsmooth quasiconvex functions and develops a quasidifferential analysis for this class of functions. Therefore, in terms of sub and superdifferentials, first order approximations of the functions are derived, optimality conditions are stated and directions of descent (either simple feasible or of steepest descent) are determined.
openaire   +1 more source

Quasiconvex functions with subquadratic growth

Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1991
Abstract We establish the existence of quasiconvex functions which are not convex and which have subquadratic grow that infinity.
openaire   +1 more source

Directional derivatives of quasiconvex functionals

Journal of Soviet Mathematics, 1988
We show that a directional derivative of a quasiconvex functional is also a quasiconvex functional. In this connection we study properties of quasiconvex and positively homogeneous functionals.
openaire   +1 more source

Home - About - Disclaimer - Privacy