Paraconvex analysis
Paraconvex functions and paraconvex sets
We study a class of functions which contains both convex functions and differentiable functions whose derivatives are locally Lipschitzian or Hölderian. This class is a subclass of the class of approximately convex functions. It enjoys refined properties. We also introduce a class of sets whose associated distance functions are of that type. We discuss the properties of the metric projections on such sets under some assumptions on the geometry of the Banach spaces in which they are embedded. We...
Piecewise-polynomial signal segmentation using convex optimization
A method is presented for segmenting one-dimensional signal whose independent segments are modeled as polynomials, and which is corrupted by additive noise. The method is based on sparse modeling, the main part is formulated as a convex optimization problem and is solved by a proximal splitting algorithm. We perform experiments on simulated and real data and show that the method is capable of reliably finding breakpoints in the signal, but requires careful tuning of the regularization parameters...
P-order necessary and sufficient conditions for optimality in singular calculus of variations
This paper is devoted to singular calculus of variations problems with constraint functional not regular at the solution point in the sense that the first derivative is not surjective. In the first part of the paper we pursue an approach based on the constructions of the p-regularity theory. For p-regular calculus of variations problem we formulate and prove necessary and sufficient conditions for optimality in singular case and illustrate our results by classical example of calculus of variations...
Proč řešit graficky úlohy lineárního programování
At universities focused on economy, Operation Research topics are usually included in the study plan, including solving of Linear Programming problems. A universal tool for their algebraic solution is (numerically difficult) Simplex Algorithm, for which it is necessary to know at least the fundamental of Matrix Algebra. To illustrate this method of solving LP problems and to discuss all types of results, it seems to be very convenient to include a chapter about graphic solutions to LP problems....