Optimality Conditions in Convex Optimization

Regular price €96.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Anulekha Dhara
A01=Joydeep Dutta
Abadie Constraint Qualification
Active Index Set
advanced convex analysis techniques
and Duality
Author_Anulekha Dhara
Author_Joydeep Dutta
Bolzano Weierstrass Theorem
Category=AKP
Category=PB
Category=PBT
Cl Cone
clarke
Clarke Subdifferential
Closed Convex
Closed Convex Cone
Closed Convex Set
Complementary Slackness Condition
Conjugate Functions
constraint
Constraint Qualification
constraint qualification theory
Convex Cone
Convex Feasible Set
Convex Function
Convex Set
Convexity in Nonconvex Optimization
CP
Differentiable Convex Function
duality in mathematical optimization
Ekeland's Variational Principle
Ekeland’s Variational Principle
eq_art-fashion-photography
eq_bestseller
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
finite dimensional analysis
Fritz John conditions
function
kkt
KKT Optimality Condition
Lower Semicontinuity
Normal Cone
normal cone methods
Optimality
Optimality without Constraint Qualification
problem
programming
qualification
Saddle Points
semi-infinite programming
set
slater
Slater Constraint Qualification
Sublinear Function
sufficient
Sufficient Optimality Condition
Tools for Convex Optimization
Weak Sharp Minima in Convex Optimization
Weak Sharp Minimizers

Product details

  • ISBN 9781138115248
  • Weight: 830g
  • Dimensions: 156 x 234mm
  • Publication Date: 31 May 2017
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
Secure checkout Fast Shipping Easy returns

Optimality Conditions in Convex Optimization explores an important and central issue in the field of convex optimization: optimality conditions. It brings together the most important and recent results in this area that have been scattered in the literature—notably in the area of convex analysis—essential in developing many of the important results in this book, and not usually found in conventional texts. Unlike other books on convex optimization, which usually discuss algorithms along with some basic theory, the sole focus of this book is on fundamental and advanced convex optimization theory.

Although many results presented in the book can also be proved in infinite dimensions, the authors focus on finite dimensions to allow for much deeper results and a better understanding of the structures involved in a convex optimization problem. They address semi-infinite optimization problems; approximate solution concepts of convex optimization problems; and some classes of non-convex problems which can be studied using the tools of convex analysis. They include examples wherever needed, provide details of major results, and discuss proofs of the main results.

Anulekha Dhara earned her Ph.d. in IIT Delhi and subsequently moved to IIT Kanpur for her post-doctoral studies. Currently, she is a post-doctoral fellow in Mathematics at the University of Avignon, France. Her main area of interest is optimization theory.

Joydeep Dutta is an Associate Professor of Mathematics at the Indian Institute of Technology, (IIT) Kanpur. His main area of interest is optimization theory and applications.

More from this author