Results 141 to 150 of about 10,275,715 (164)

Second order characterizations of pseudoconvex functions

Mathematical Programming, 1978
Second order characterizations for (strictly) pseudoconvex functions are derived in terms of extended Hessians and bordered determinants. Additional results are presented for quadratic functions.
Mordecai Avriel, Siegfried Schaible
openaire   +3 more sources

Deformations and embeddings of three-dimensional strictly pseudoconvex CR manifolds

Mathematische Annalen, 2020
deformations of the CR structure of a compact strictly pseudoconvex hypersurface $M$ in $\mathbb{C}^2$ are encoded by complex functions on $M$. In sharp contrast with the higher dimensional case, the natural integrability condition for $3$-dimensional CR
Sean N. Curry, P. Ebenfelt
semanticscholar   +1 more source

Certain classes of pseudoconvex functionals

Journal of Soviet Mathematics, 1988
Translation from Issled. Prikl. Mat. 2, 63-70 (Russian) (1974; Zbl 0314.26011).
openaire   +2 more sources

A Finite-Time Consensus Continuous-Time Algorithm for Distributed Pseudoconvex Optimization With Local Constraints

IEEE Transactions on Automatic Control
In this article, we develop a continuous-time algorithm based on a multiagent system for solving distributed, nonsmooth, and pseudoconvex optimization problems with local convex inequality constraints.
Sijian Wang, Xin Yu
semanticscholar   +1 more source

Some properties of nondifferentiable pseudoconvex functions

Mathematical Programming, 1983
It is shown that certain theorems concerning differentiable pseudoconvex functions can be extended to a class of nonsmooth pseudo-convex functions defined via the upper directional Dini derivative f'\({}_+(x;d)\) (instead of the usual linear mapping \()\).
openaire   +3 more sources

Minimizing pseudoconvex functions on convex compact sets

Journal of Optimization Theory and Applications, 1990
An algorithm is presented which minimizes continuously differentiable pseudo-convex functions on convex compact sets which are characterized by their support functions. If the function can be minimized exactly on affine sets in a finite number of operations and the constraints set is a polytope, the algorithm has finite convergence.
J. E. Higgins, Elijah Polak
openaire   +3 more sources

A Delayed Neural Network for Solving a Class of Constrained Pseudoconvex Optimizations

International Conference on Information and Software Technologies, 2019
This paper presents a delayed neural network (DNN) to solve a pseudoconvex optimization problem with equality constraints. Based on differential inclusion theory, the equilibrium point of the proposed DNN is proved to be exponentially stable.
Xingnan Wen, Sitian Qin, Jiqiang Feng, Guocheng Li, Ping Guo   +4 more
semanticscholar   +1 more source

Relaxation methods of minimization of pseudoconvex functions

Journal of Soviet Mathematics, 1989
See the preview in Zbl 0501.65025.
openaire   +2 more sources

H p -Functions on Strictly Pseudoconvex Domains

American Journal of Mathematics, 1976
Introduction. In this paper we study some questions concerning HP-functions on strictly pseudoconvex domains in CN. For the most part, the results we obtain are analogues of well known theorems in one variable. The first section is devoted to a few preliminaries about the Hardy classes on domains in CN.
openaire   +2 more sources

The Neumann Problem for the k-Cauchy–Fueter Complex over k-Pseudoconvex Domains in $$\mathbb {R}^4$$R4 and the $$L^2$$L2 Estimate

, 2017
The k-Cauchy–Fueter operator and complex are quaternionic counterparts of the Cauchy–Riemann operator and the Dolbeault complex in the theory of several complex variables, respectively. To develop the function theory of several quaternionic variables, we
Wei Wang
semanticscholar   +1 more source