IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v156y2013i3d10.1007_s10957-012-0134-2.html
   My bibliography  Save this article

Alternating Minimization as Sequential Unconstrained Minimization: A Survey

Author

Listed:
  • Charles L. Byrne

    (University of Massachusetts Lowell)

Abstract

Sequential unconstrained minimization is a general iterative method for minimizing a function over a given set. At each step of the iteration we minimize the sum of the objective function and an auxiliary function. The aim is to select the auxiliary functions so that, at least, we get convergence in function value to the constrained minimum. The SUMMA is a broad class of these methods for which such convergence holds. Included in the SUMMA class are the barrier-function methods, entropic and other proximal minimization algorithms, the simultaneous multiplicative algebraic reconstruction technique, and, after some reformulation, penalty-function methods. The alternating minimization method of Csiszár and Tusnády also falls within the SUMMA class, whenever their five-point property holds. Therefore, the expectation maximization maximum likelihood algorithm for the Poisson case is also in the SUMMA class.

Suggested Citation

  • Charles L. Byrne, 2013. "Alternating Minimization as Sequential Unconstrained Minimization: A Survey," Journal of Optimization Theory and Applications, Springer, vol. 156(3), pages 554-566, March.
  • Handle: RePEc:spr:joptap:v:156:y:2013:i:3:d:10.1007_s10957-012-0134-2
    DOI: 10.1007/s10957-012-0134-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0134-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-012-0134-2?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. Charles Byrne & Yair Censor, 2001. "Proximity Function Minimization Using Multiple Bregman Projections, with Applications to Split Feasibility and Kullback–Leibler Distance Minimization," Annals of Operations Research, Springer, vol. 105(1), pages 77-98, July.
    2. Marc Teboulle, 1992. "Entropic Proximal Mappings with Applications to Nonlinear Programming," Mathematics of Operations Research, INFORMS, vol. 17(3), pages 670-690, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jason Xu & Eric C. Chi & Meng Yang & Kenneth Lange, 2018. "A majorization–minimization algorithm for split feasibility problems," Computational Optimization and Applications, Springer, vol. 71(3), pages 795-828, December.

    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. Emanuel Laude & Peter Ochs & Daniel Cremers, 2020. "Bregman Proximal Mappings and Bregman–Moreau Envelopes Under Relative Prox-Regularity," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 724-761, March.
    2. Papa Quiroz, E.A. & Roberto Oliveira, P., 2012. "An extension of proximal methods for quasiconvex minimization on the nonnegative orthant," European Journal of Operational Research, Elsevier, vol. 216(1), pages 26-32.
    3. Regina Sandra Burachik & B. F. Svaiter, 2001. "A Relative Error Tolerance for a Family of Generalized Proximal Point Methods," Mathematics of Operations Research, INFORMS, vol. 26(4), pages 816-831, November.
    4. Villacorta, Kely D.V. & Oliveira, P. Roberto, 2011. "An interior proximal method in vector optimization," European Journal of Operational Research, Elsevier, vol. 214(3), pages 485-492, November.
    5. Paul Tseng, 2004. "An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods," Mathematics of Operations Research, INFORMS, vol. 29(1), pages 27-44, February.
    6. Xianfu Wang & Xinmin Yang, 2015. "On the Existence of Minimizers of Proximity Functions for Split Feasibility Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 861-888, September.
    7. K. C. Kiwiel, 1998. "Subgradient Method with Entropic Projections for Convex Nondifferentiable Minimization," Journal of Optimization Theory and Applications, Springer, vol. 96(1), pages 159-173, January.
    8. Pinheiro, Ricardo B.N.M. & Lage, Guilherme G. & da Costa, Geraldo R.M., 2019. "A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 1137-1153.
    9. Hédy Attouch & Jérôme Bolte & Patrick Redont & Antoine Soubeyran, 2010. "Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 438-457, May.
    10. Jonathan Eckstein & Paulo Silva, 2010. "Proximal methods for nonlinear programming: double regularization and inexact subproblems," Computational Optimization and Applications, Springer, vol. 46(2), pages 279-304, June.
    11. Regina S. Burachik & Minh N. Dao & Scott B. Lindstrom, 2021. "Generalized Bregman Envelopes and Proximity Operators," Journal of Optimization Theory and Applications, Springer, vol. 190(3), pages 744-778, September.
    12. S. H. Pan & J. S. Chen, 2008. "Proximal-Like Algorithm Using the Quasi D-Function for Convex Second-Order Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 138(1), pages 95-113, July.
    13. Volkovich, Vladimir & Kogan, Jacob & Nicholas, Charles, 2007. "Building initial partitions through sampling techniques," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1097-1105, December.
    14. Arnaldo S. Brito & J. X. Cruz Neto & Jurandir O. Lopes & P. Roberto Oliveira, 2012. "Interior Proximal Algorithm for Quasiconvex Programming Problems and Variational Inequalities with Linear Constraints," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 217-234, July.
    15. Jein-Shan Chen & Shaohua Pan, 2010. "An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming," Computational Optimization and Applications, Springer, vol. 47(3), pages 477-499, November.
    16. H. Attouch & M. Teboulle, 2004. "Regularized Lotka-Volterra Dynamical System as Continuous Proximal-Like Method in Optimization," Journal of Optimization Theory and Applications, Springer, vol. 121(3), pages 541-570, June.
    17. Hong T. M. Chu & Ling Liang & Kim-Chuan Toh & Lei Yang, 2023. "An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems," Computational Optimization and Applications, Springer, vol. 85(1), pages 107-146, May.
    18. Hui Ouyang & Xianfu Wang, 2021. "Bregman Circumcenters: Basic Theory," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 252-280, October.
    19. K. Kiwiel, 1994. "A Note on the Twice Differentiable Cubic Augmented Lagrangian," Working Papers wp94012, International Institute for Applied Systems Analysis.
    20. K. Kiwiel, 1995. "Proximal Minimization Methods with Generalized Bregman Functions," Working Papers wp95024, International Institute for Applied Systems Analysis.

    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:156:y:2013:i:3:d:10.1007_s10957-012-0134-2. 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.