IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v104y2000i3d10.1023_a1004681407608.html
   My bibliography  Save this article

Infeasible Predictor-Corrector Interior-Point Method Applied to Image Restoration in the Presence of Noise

Author

Listed:
  • C. Pola

    (Universidad de Cantabria)

  • C. A. Sagastizábal

    (INRIA
    Pontifícia Universidade Catôlica)

Abstract

Image recovery problems can be solved using optimization techniques. They lead often to the solution of either a large-scale convex quadratic program or equivalently a nondifferentiable minimization problem. To solve the quadratic program, we use an infeasible predictor-corrector interior-point method, presented in the more general framework of monotone LCP. The algorithm has polynomial complexity and it converges with asymptotic quadratic rate. When implementing the method to recover images, we take advantage of the underlying sparsity of the problem. We obtain good performances, that we assess by comparing the method with a variable-metric proximal bundle algorithm applied to the solution of equivalent nonsmooth problem.

Suggested Citation

  • C. Pola & C. A. Sagastizábal, 2000. "Infeasible Predictor-Corrector Interior-Point Method Applied to Image Restoration in the Presence of Noise," Journal of Optimization Theory and Applications, Springer, vol. 104(3), pages 517-538, March.
  • Handle: RePEc:spr:joptap:v:104:y:2000:i:3:d:10.1023_a:1004681407608
    DOI: 10.1023/A:1004681407608
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1004681407608
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1004681407608?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. Frédéric Bonnans & Clovis C. Gonzaga, 1996. "Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 21(1), pages 1-25, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cosmin G. Petra & Florian A. Potra, 2019. "A homogeneous model for monotone mixed horizontal linear complementarity problems," Computational Optimization and Applications, Springer, vol. 72(1), pages 241-267, January.
    2. M. A. Goberna & T. Terlaky & M. I. Todorov, 2010. "Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 14-26, February.
    3. R. Andreani & A. Friedlander & J. M. Martínez, 1997. "Solution of Finite-Dimensional Variational Inequalities Using Smooth Optimization with Simple Bounds," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 635-657, September.
    4. Jos F. Sturm, 1999. "Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 72-94, February.
    5. Potra, Florian A., 2002. "The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path," European Journal of Operational Research, Elsevier, vol. 143(2), pages 257-267, December.
    6. Josef Stoer & Martin Wechs & Shinji Mizuno, 1998. "High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 832-862, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:104:y:2000:i:3:d:10.1023_a:1004681407608. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.