Results 271 to 280 of about 621,582 (323)
Some of the next articles are maybe not open access.

Convex Analysis on the Hermitian Matrices

SIAM Journal on Optimization, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Convex Analysis

1995
This chapter discusses the elements of convex analysis which are very important in the study of optimization problems. In section 2.1 the fundamentals of convex sets are discussed. In section 2.2 the subject of convex and concave functions is presented, while in section 2.3 generalizations of convex and concave functions are outlined.
openaire   +1 more source

Fundamentals of Convex Analysis

2001
International ...
Hiriart-Urruty, Jean-Baptiste   +1 more
openaire   +2 more sources

Preliminaries: Convex Analysis and Convex Programming

2001
In this chapter, we give some definitions and results connected with convex analysis, convex programming, and Lagrangian duality. In Part Two, these concepts and results are utilized in developing suitable optimality conditions and numerical methods for solving some convex problems.
openaire   +1 more source

Differentials and Convex Analysis

2021
Abstract Mathematical tools necessary to the argument are presented and discussed. The focus is on concepts borrowed from the convex analysis and variational analysis literatures. The chapter starts by introducing the notions of a correspondence, upper hemi-continuity, and lower hemi-continuity.
openaire   +1 more source

Convex Analysis

2021
Vladimir A. Bushenkov, Georgi V. Smirnov
openaire   +1 more source

Convex Analysis

2022
Indu Solomon, Uttam Kumar
openaire   +1 more source

The analysis of convex blobs

Computer Graphics and Image Processing, 1972
The analysis of shape is not well understood. To further our understanding it seemsreasonable to concentrate on one aspect of the problem. This paper deals with the analysis of convex blobs. The aim of the analysis is to extract fragments of a blob which are perceptually meaningful. This is done by attributing to each point a set of neigh boring points
openaire   +1 more source

Conjugacy in Convex Analysis

1993
In classical real analysis, the gradient of a differentiable function f : ℝn → ℝ. plays a key role - to say the least. Considering this gradient as a mapping x ↦ s(x) = ∇f(x) from (some subset X of) ℝn to (some subset S of) ℝn, an interesting object is then its inverse: to a given s ∈ S, associate the x ∈ X such that s = ∇f(x).
Jean-Baptiste Hiriart-Urruty   +1 more
openaire   +1 more source

Motion planning around obstacles with convex optimization

Science Robotics, 2023
Tobia Marcucci
exaly  

Home - About - Disclaimer - Privacy