Complementarity: Applications, Algorithms and Extensions

Name: Complementarity: Applications, Algorithms and Extensions
Brand: Springer Nature
SKU: 9780792368168
Availability: InStock

Best Price (Coupon Required):
Buy Complementarity: Applications, Algorithms and Extensions for $116.10 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $129.00 - $129.00

BEST PRICE

Single Product Purchase

$116.10

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$129.00	$129.00		10% OFF This deals requires coupon	$116.10		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9780792368168

Condition

New

Product Description

This volume presents state-of-the-art complementarity applications, algorithms, extensions and theory in the form of eighteen papers. These at the International Conference on Com invited papers were presented plementarity 99 (ICCP99) held in Madison, Wisconsin during June 9-12, 1999 with support from the National Science Foundation under Grant DMS-9970102. Complementarity is becoming more widely used in a variety of appli cation areas. In this volume, there are papers studying the impact of complementarity in such diverse fields as deregulation of electricity mar kets, engineering mechanics, optimal control and asset pricing. Further more, application of complementarity and optimization ideas to related problems in the burgeoning fields of machine learning and data mining are also covered in a series of three articles. In order to effectively process the complementarity problems that arise in such applications, various algorithmic, theoretical and computational extensions are covered in this volume. Nonsmooth analysis has an im portant role to play in this area as can be seen from articles using these tools to develop Newton and path following methods for constrained nonlinear systems and complementarity problems. Convergence issues are covered in the context of active set methods, global algorithms for pseudomonotone variational inequalities, successive convex relaxation and proximal point algorithms. Theoretical contributions to the connectedness of solution sets and constraint qualifications in the growing area of mathematical programs with equilibrium constraints are also presented. A relaxation approach is given for solving such problems. Finally, computational issues related to preprocessing mixed complementarity problems are addressed.

Available Colors

N/A

Available Sizes

N/A