Skip to main content
SpringerLink
Log in

Introduction

  • Chapter
  • First Online:
Numerical Optimization with Computational Errors

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 108))

  • 1668 Accesses

Abstract

In this book we study behavior of algorithms for constrained convex minimization problems in a Hilbert space. Our goal is to obtain a good approximate solution of the problem in the presence of computational errors. We show that the algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant. In this section we discuss several algorithms which are studied in the book.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.00
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Alber YI (1971) On minimization of smooth functional by gradient methods. USSR Comput Math Math Phys 11:752–758

    MathSciNet  Google Scholar 

  2. Alber YI, Iusem AN, Solodov MV (1998) On the projected subgradient method for nonsmooth convex optimization in a Hilbert space. Math Program 81:23–35

    MathSciNet  MATH  Google Scholar 

  3. Ansari QH, Yao JC (1999) A fixed point theorem and its applications to a system of variational inequalities. Bull Aust Math Soc 59:433–442

    Article  MathSciNet  MATH  Google Scholar 

  4. Attouch H, Bolte J (2009) On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math Program Ser B 116:5–16

    Article  MathSciNet  MATH  Google Scholar 

  5. Barty K, Roy J-S, Strugarek C (2007) Hilbert-valued perturbed subgradient algorithms. Math Oper Res 32:551–562

    Article  MathSciNet  MATH  Google Scholar 

  6. Bauschke HH, Borwein JM, Combettes PL (2003) Bregman monotone optimization algorithms. SIAM J Control Optim 42:596–636

    Article  MathSciNet  MATH  Google Scholar 

  7. Bauschke HH, Goebel R, Lucet Y, Wang X (2008) The proximal average: basic theory. SIAM J Optim 19:766–785

    Article  MathSciNet  MATH  Google Scholar 

  8. Beck A, Teboulle M (2003) Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper Res Lett 31:167–175

    Article  MathSciNet  MATH  Google Scholar 

  9. Burachik RS, Iusem AN (1998) A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J Optim 8:197–216

    Article  MathSciNet  MATH  Google Scholar 

  10. Burachik RS, Grana Drummond LM, Iusem AN, Svaiter BF (1995) Full convergence of the steepest descent method with inexact line searches. Optimization 32:137–146

    Article  MathSciNet  MATH  Google Scholar 

  11. Burachik RS, Lopes JO, Da Silva GJP (2009) An inexact interior point proximal method for the variational inequality problem. Comput Appl Math 28:15–36

    MathSciNet  MATH  Google Scholar 

  12. Butnariu D, Kassay G (2008) A proximal-projection method for finding zeros of set-valued operators. SIAM J Control Optim 47:2096–2136

    Article  MathSciNet  MATH  Google Scholar 

  13. Censor Y, Zenios SA (1992) The proximal minimization algorithm with D-functions. J. Optim. Theory Appl. 73:451–464

    Article  MathSciNet  MATH  Google Scholar 

  14. Censor Y, Gibali A, Reich S (2011) The subgradient extragradient method for solving variational inequalities in Hilbert space. J Optim Theory Appl 148:318–335

    Article  MathSciNet  MATH  Google Scholar 

  15. Censor Y, Gibali A, Reich S, Sabach S (2012) Common solutions to variational inequalities. Set-Valued Var Anal 20:229–247

    Article  MathSciNet  MATH  Google Scholar 

  16. Demyanov VF, Vasilyev LV (1985) Nondifferentiable optimization. Optimization Software, New York

    Book  Google Scholar 

  17. Ermoliev YM (1966) Methods for solving nonlinear extremal problems. Cybernetics 2:1–17

    Article  Google Scholar 

  18. Facchinei F, Pang J-S (2003) Finite-dimensional variational inequalities and complementarity problems, volume I and volume II. Springer, New York

    MATH  Google Scholar 

  19. Guler O (1991) On the convergence of the proximal point algorithm for convex minimization. SIAM J Control Optim 29:403–419

    Article  MathSciNet  MATH  Google Scholar 

  20. Gwinner J, Raciti F (2009) On monotone variational inequalities with random data. J Math Inequal 3:443–453

    Article  MathSciNet  MATH  Google Scholar 

  21. Hager WW, Zhang H (2007) Asymptotic convergence analysis of a new class of proximal point methods. SIAM J Control Optim 46:1683–1704

    Article  MathSciNet  MATH  Google Scholar 

  22. Iiduka H, Takahashi W, Toyoda M (2004) Approximation of solutions of variational inequalities for monotone mappings. Pan Am Math J 14:49–61

    MathSciNet  MATH  Google Scholar 

  23. Kaplan A, Tichatschke R (2007) Bregman-like functions and proximal methods for variational problems with nonlinear constraints. Optimization 56:253–265

    Article  MathSciNet  MATH  Google Scholar 

  24. Kassay G (1985) The proximal points algorithm for reflexive Banach spaces. Stud Univ Babes-Bolyai Math 30:9–17

    MathSciNet  MATH  Google Scholar 

  25. Kiwiel KC (1996) Restricted step and Levenberg–Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization. SIAM J Optim 6:227–249

    Article  MathSciNet  MATH  Google Scholar 

  26. Konnov IV (1997) On systems of variational inequalities. Russ Math (Iz VUZ) 41:79–88

    MathSciNet  MATH  Google Scholar 

  27. Konnov IV (2009) A descent method with inexact linear search for mixed variational inequalities. Russ Math (Iz VUZ) 53:29–35

    MathSciNet  MATH  Google Scholar 

  28. Korpelevich GM (1976) The extragradient method for finding saddle points and other problems. Ekon Matem Metody 12:747–756

    MathSciNet  MATH  Google Scholar 

  29. Lemaire B (1989) The proximal algorithm. In: Penot JP (ed) International series of numerical mathematics, vol 87. Birkhauser-Verlag, Basel, pp 73–87

    Google Scholar 

  30. Mainge P-E (2008) Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. Set-Valued Anal 16:899–912

    Article  MathSciNet  MATH  Google Scholar 

  31. Martinet B (1978) Pertubation des methodes d’optimisation: application. RAIRO Anal Numer 12:153–171

    MathSciNet  MATH  Google Scholar 

  32. Mordukhovich BS (2006) Variational analysis and generalized differentiation, I: I: basic theory. Springer, Berlin

    Google Scholar 

  33. Moreau JJ (1965) Proximite et dualite dans un espace Hilbertien. Bull Soc Math Fr 93:273–299

    MathSciNet  MATH  Google Scholar 

  34. Nedic A, Ozdaglar A (2009) Subgradient methods for saddle-point problems. J Optim Theory Appl 142:205–228

    Article  MathSciNet  MATH  Google Scholar 

  35. Nemirovski A, Yudin D (1983) Problem complexity and method efficiency in optimization. Wiley, New York

    Google Scholar 

  36. Nesterov Yu (2004) Introductory lectures on convex optimization. Kluwer, Boston

    Google Scholar 

  37. Pang J-S (1985) Asymmetric variational inequality problems over product sets: applications and iterative methods. Math Program 31:206–219

    Article  MathSciNet  MATH  Google Scholar 

  38. Polyak BT (1967) A general method of solving extremum problems. Dokl Akad Nauk 8:593–597

    MATH  Google Scholar 

  39. Polyak BT (1987) Introduction to optimization. Optimization Software, New York

    MATH  Google Scholar 

  40. Rockafellar RT (1976) Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math Oper Res 1:97–116

    Article  MathSciNet  MATH  Google Scholar 

  41. Rockafellar RT (1976) Monotone operators and the proximal point algorithm. SIAM J Control Optim 14:877–898

    Article  MathSciNet  MATH  Google Scholar 

  42. Shor NZ (1985) Minimization methods for non-differentiable functions. Springer, Berlin

    Book  MATH  Google Scholar 

  43. Solodov MV, Svaiter BF (2000) Error bounds for proximal point subproblems and associated inexact proximal point algorithms. Math Program 88:371–389

    Article  MathSciNet  MATH  Google Scholar 

  44. Solodov MV, Svaiter BF (2001) A unified framework for some inexact proximal point algorithms. Numer Funct Anal Optim 22:1013–1035

    Article  MathSciNet  MATH  Google Scholar 

  45. Solodov MV, Zavriev SK (1998) Error stability properties of generalized gradient-type algorithms. J Optim Theory Appl 98:663–680

    Article  MathSciNet  MATH  Google Scholar 

  46. Su M, Xu H-K (2010) Remarks on the gradient-projection algorithm. J Nonlinear Anal Optim 1:35–43

    MathSciNet  Google Scholar 

  47. Xu H-K (2006) A regularization method for the proximal point algorithm. J Global Optim 36:115–125

    Article  MathSciNet  MATH  Google Scholar 

  48. Xu H-K (2011) Averaged mappings and the gradient-projection algorithm. J Optim Theory Appl 150:360–378

    Article  MathSciNet  MATH  Google Scholar 

  49. Yamashita N, Kanzow C, Morimoto T, Fukushima M (2001) An infeasible interior proximal method for convex programming problems with linear constraints. J Nonlinear Convex Anal 2:139–156

    MathSciNet  MATH  Google Scholar 

  50. Zeng LC, Yao JC (2006) Strong convergence theorem by an extragradient method for fixed point problems and variational inequality problems. Taiwan J Math 10:1293–1303

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The Technion – Israel Institute of Technology, Haifa, Israel

    Alexander J. Zaslavski

Authors
  1. Alexander J. Zaslavski
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Zaslavski, A.J. (2016). Introduction. In: Numerical Optimization with Computational Errors. Springer Optimization and Its Applications, vol 108. Springer, Cham. https://doi.org/10.1007/978-3-319-30921-7_1

Download citation

Publish with us

Policies and ethics

Search

Navigation