IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v13y2005i1p127-143.html
   My bibliography  Save this article

Necessary optimality conditions and saddle points for approximate optimization in banach spaces

Author

Listed:
  • J. Dutta

Abstract

No abstract is available for this item.

Suggested Citation

  • J. Dutta, 2005. "Necessary optimality conditions and saddle points for approximate optimization in banach spaces," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(1), pages 127-143, June.
    • Handle: RePEc:spr:topjnl:v:13:y:2005:i:1:p:127-143
    DOI: 10.1007/BF02578991
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02578991
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02578991?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.

    Citations

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


    Cited by:

    1. C. Gutiérrez & L. Huerga & B. Jiménez & V. Novo, 2020. "Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 526-544, July.
    2. T. Son & D. Kim, 2013. "ε-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints," Journal of Global Optimization, Springer, vol. 57(2), pages 447-465, October.
    3. Liguo Jiao & Jae Hyoung Lee, 2018. "Approximate Optimality and Approximate Duality for Quasi Approximate Solutions in Robust Convex Semidefinite Programs," Journal of Optimization Theory and Applications, Springer, vol. 176(1), pages 74-93, January.
    4. C. Gutiérrez & R. López & J. Martínez, 2022. "Generalized $${\varepsilon }$$ ε -quasi solutions of set optimization problems," Journal of Global Optimization, Springer, vol. 82(3), pages 559-576, March.
    5. T. Q. Son & J. J. Strodiot & V. H. Nguyen, 2009. "ε-Optimality and ε-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints," Journal of Optimization Theory and Applications, Springer, vol. 141(2), pages 389-409, May.

    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:13:y:2005:i:1:p:127-143. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.