Skip to main content

Active Set Strategy for the Obstacle Problem with a T-Monotone Operator

  • Conference paper
  • 1553 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 159))

Abstract

In this paper, we consider the numerical solution of finite-dimensional variational inequalities of obstacle type associated with some free boundary problem with T -monotone operator. Algorithm based on active set strategy is proposed for the problem. Each iteration consists of two steps. In the first step, the index set is decomposed into active and inactive parts, based on a certain criterion. In the second step, a reduced nonlinear system associated with the inactive set is solved. Convergence theorem of the algorithm is established.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Meyer, G.H.: Free Boundary Problems with Nonlinear Source Terms. Numer. Math. 43, 463–482 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hoppe, R.: Two-Sided Approximations for Unilateral Variational Inequalities by Multigrid Methods. Optim. 18, 867–881 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hoppe, R., Kornhuber, R.: Adaptive Multilevel Methods for Obstacle Problems. SIAM J. Numer. Anal. 31, 301–323 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hoppe, R.: Multigrid Algorithms for Variational Inequalities. SIAM J. Numer. Anal. 24, 1046–1065 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kärkkäinen, T., Kunisch, K., Tarvainen, P.: Augmented Lagrangian Active Set Methods for Obstacle Problems. J. Optim. Theory Appl. 119, 499–533 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Zeng, J.P., Zhou, S.Z.: A Domain Decomposition Method for a Kind of Optimization Problems. J. Comput. Appl. Math. 146, 127–139 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xie, S., Xu, H. (2011). Active Set Strategy for the Obstacle Problem with a T-Monotone Operator. In: Yu, Y., Yu, Z., Zhao, J. (eds) Computer Science for Environmental Engineering and EcoInformatics. CSEEE 2011. Communications in Computer and Information Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22691-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22691-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22690-8

  • Online ISBN: 978-3-642-22691-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics