Results 311 to 320 of about 84,906 (335)

Convex Optimization With Convex Constraints

2001
In this chapter we want to solve the problem minf(x) | x ∈ C, where f is a convex function on ℝ n , and C is a convex, nonempty subset of ℝ n . A point x* ∈ C is a global solution, or more simply a solution to this problem, or a minimizer of f on C, if f(x*) ≤ f(x), ∀x ∈ C. We say that x* is a local solution to this problem if there exists a relatively
Cuong Le Van, Monique Florenzano
openaire   +2 more sources

Convex Sets and Convex Functions [PDF]

, 1979
Because of their useful properties, the notions of convex sets and convex functions find many uses in the various areas of Applied Mathematics. We begin with the basic definition of a convex set in n-dimensional Euclidean Space (En), where points are ordered n-tuples of real numbers such as x’ = (x1, x2,…, xn) and y’ = (y1, y2,…,yn).
openaire   +1 more source

Convex polytopes with convex nets

Mathematical Proceedings of the Cambridge Philosophical Society, 1975
The idea of anetwill be familiar to anyone who has made a model of a three-dimensional convex polytope (3-polytope) out of a flat sheet of card or similar material. To begin with, one cuts out a polygon, and then the model is formed by folding this and joining its edges in an appropriate manner. For example, Fig.
openaire   +2 more sources

Convex Interpolation of Convex Data

1977
Abstract : This report contains the mathematical basis of an interpolation technique that constructs a smooth convex interpolant, called an H-Spline, for convex data on the real line. It is shown that an H-Spline always exists and is unique.
openaire   +2 more sources

Convex Sets and Convex Programming

1981
In this chapter we concentrate on properties of convex sets in a Hilbert space and some of the related problems of importance in application to convex programming: variational problems for convex functions over convex sets, central to which are the Kuhn-Tucker theorem and the minimax theorem of von Neumann, which in turn are based on the “separation ...
openaire   +2 more sources

On <i>n</i>-Polynomial convexity and some related inequalities

AIMS Mathematics, 2020
Mahir Kadakal, Mdat İşCan
exaly  

Dynamical convexity and closed orbits on symmetric spheres

Duke Mathematical Journal, 2021
Viktor L Ginzburg, Leonardo Macarini
exaly  

On approximating minimizers of convex functionals with a convexity constraint by singular Abreu equations without uniform convexity

Proceedings of the Royal Society of Edinburgh Section A: Mathematics, 2021
exaly  

Convexity

2008
openaire   +1 more source

Convexity Shape Prior for Binary Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2017
Olga Veksler, Yuri Boykov
exaly