Duality for nonconvex approximation and optimization

Author(s)

Bibliographic Information

Duality for nonconvex approximation and optimization

Ivan Singer

(CMS books in mathematics, 24)

Springer, c2006

  • pbk.

Available at  / 1 libraries

Search this Book/Journal

Note

Includes bibliographical references (p.[329]-345) and index

Description and Table of Contents

Description

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.

Table of Contents

Preliminaries.- Worst Approximation.- Duality for Quasi-convex Supremization.- Optimal Solutions for Quasi-convex Maximization.- Reverse Convex Best Approximation.- Unperturbational Duality for Reverse Convex Infimization.- Optimal Solutions for Reverse Convex Infimization.- Duality for D.C. Optimization Problems.- Duality for Optimization in the Framework of Abstract Convexity.- Notes and Remarks.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

Page Top