IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v25y2017i2d10.1007_s11750-016-0431-2.html
   My bibliography  Save this article

A Lagrange duality approach for multi-composed optimization problems

Author

Listed:
  • Gert Wanka

    (Chemnitz University of Technology)

  • Oleg Wilfer

    (Chemnitz University of Technology)

Abstract

In this paper, we consider an optimization problem with geometric and cone constraints, whose objective function is a composition of $$n+1$$ n + 1 functions. For this problem, we calculate its conjugate dual problem, where the functions involved in the objective function of the primal problem will be decomposed. Furthermore, we formulate generalized interior point regularity conditions for strong duality and give necessary and sufficient optimality conditions. As applications of this approach, we determine the formulas of the conjugate as well as the biconjugate of the objective function of the primal problem and discuss an optimization problem having as objective function the sum of reciprocals of concave functions.

Suggested Citation

  • Gert Wanka & Oleg Wilfer, 2017. "A Lagrange duality approach for multi-composed optimization problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(2), pages 288-313, July.
    • Handle: RePEc:spr:topjnl:v:25:y:2017:i:2:d:10.1007_s11750-016-0431-2
    DOI: 10.1007/s11750-016-0431-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-016-0431-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/s11750-016-0431-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. Radu Boţ & Christopher Hendrich, 2013. "A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems," Computational Optimization and Applications, Springer, vol. 54(2), pages 239-262, March.
    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. Sorin-Mihai Grad & Oleg Wilfer, 2019. "A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality," Journal of Global Optimization, Springer, vol. 74(1), pages 121-160, May.

    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. Quoc Tran-Dinh, 2017. "Adaptive smoothing algorithms for nonsmooth composite convex minimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 425-451, April.
    2. E. M. Bednarczuk & A. Jezierska & K. E. Rutkowski, 2018. "Proximal primal–dual best approximation algorithm with memory," Computational Optimization and Applications, Springer, vol. 71(3), pages 767-794, December.
    3. Masoud Ahookhosh & Arnold Neumaier, 2018. "Solving structured nonsmooth convex optimization with complexity $$\mathcal {O}(\varepsilon ^{-1/2})$$ O ( ε - 1 / 2 )," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 110-145, April.
    4. Radu Boţ & Christopher Hendrich, 2015. "A variable smoothing algorithm for solving convex optimization problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 124-150, April.

    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:topjnl:v:25:y:2017:i:2:d:10.1007_s11750-016-0431-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.