Results 31 to 40 of about 22,170,122 (349)
In this paper, a new class of functions, namely, exponentially α,h−m−p-convex functions is introduced to unify various classes of functions already defined in the subject of convex analysis.
Kamsing Nonlaopon+4 more
doaj +1 more source
A convex analysis approach to multi-material topology optimization. [PDF]
This work is concerned with optimal control of partial differential equations where the control enters the state equation as a coefficient and should take on values only from a given discrete set of values corresponding to available materials.
Christian Clason, K. Kunisch
semanticscholar +1 more source
This textbook is based on lectures given by the authors at MIPT (Moscow), HSE (Moscow), FEFU (Vladivostok), V.I. Vernadsky KFU (Simferopol), ASU (Republic of Adygea), and the University of Grenoble-Alpes (Grenoble, France).
Stephen P. Boyd, L. Vandenberghe
semanticscholar +1 more source
Many researchers have been attracted to the study of convex analysis theory due to both facts, theoretical significance, and the applications in optimization, economics, and other fields, which has led to numerous improvements and extensions of the ...
Asfand Fahad+3 more
doaj +1 more source
Discrete convex analysis [PDF]
A theory of "discrete convex analysis" is developed for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, subgradients, the Fenchel min-max duality, separation theorems and the Lagrange duality framework for convex ...
openaire +2 more sources
An introduction to non-smooth convex analysis via multiplicative derivative
In this study, *-directional derivative and *-subgradient are defined using the multiplicative derivative, making a new contribution to non-Newtonian calculus for use in non-smooth analysis.
Ali Hakan Tor
doaj +1 more source
Dual
The optimal power flow (OPF) model is a central optimization problem in power system network. In this paper, we propose a novel approach to solve the OPF problem that has a convex objective function and non-convex feasible domain due to the constraints ...
Liulin Yang, Naishan Hang, Zhi Wei
doaj +1 more source
Stable Principal Component Pursuit via Convex Analysis
This paper aims to recover a low-rank matrix and a sparse matrix from their superposition observed in additive white Gaussian noise by formulating a convex optimization problem with a non-separable non-convex regularization.
Lei Yin, Ankit Parekh, I. Selesnick
semanticscholar +1 more source
Convexity and logical analysis of data
AbstractA Boolean function is called k-convex if for any pair x,y of its true points at Hamming distance at most k, every point “between” x and y is also true. Given a set of true points and a set of false points, the central question of Logical Analysis of Data is the study of those Boolean functions whose values agree with those of the given points ...
Ekin O., Hammer P.L., Kogan, A.
openaire +5 more sources
A class of degenerate elliptic eigenvalue problems
We consider a general class of eigenvalue problems where the leading elliptic term corresponds to a convex homogeneous energy function that is not necessarily differentiable.
Lucia Marcello, Schuricht Friedemann
doaj +1 more source