Wednesday, February 6, 2008
Duality for Nonconvex Approximation and Optimization The theory of convex optimization has been constantly developing over the past 30 years. Most recently, many researchers have been studying more complicated classes of problems that still can be studied by means of convex analysis, so-called "anticonvex" and "convex-anticonvex" optimizaton problems. This manuscript contains an exhaustive presentation of the duality for these classes of problems and some of its generalization in the framework of abstract convexity. This manuscript will be of great interest for experts in this and related fields. http://rapidshare.com/files/64590118/DuNAO.rar.html |
Previous Posts
- How to Help Your Child Excel in Math
- Plane Algebraic Curves
- Elementary Probability Theory
- Finite Model Theory and Its Applications
- Free Boundary Problems (International Series of Nu...
- Fun with Algorithms: 4th International Conference,...
- Geometric Dynamics: Proc of Intl Symp, Held at Ins...
- Geometry: The Language of Space and Form (History ...
- Geometric Modelling, Numerical Simulation, and Opt...
- Geometric Integration Theory