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

Generalized derivatives and nonsmooth optimization, a finite dimensional tour

Author

Listed:
  • Joydeep Dutta

Abstract

No abstract is available for this item.

Suggested Citation

  • Joydeep Dutta, 2005. "Generalized derivatives and nonsmooth optimization, a finite dimensional tour," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(2), pages 185-279, December.
    • Handle: RePEc:spr:topjnl:v:13:y:2005:i:2:p:185-279
    DOI: 10.1007/BF02579049
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02579049
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02579049?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. V. Jeyakumar & G. M. Lee & N. Dinh, 2004. "Lagrange Multiplier Conditions Characterizing the Optimal Solution Sets of Cone-Constrained Convex Programs," Journal of Optimization Theory and Applications, Springer, vol. 123(1), pages 83-103, October.
    2. Y. Gao, 2000. "Demyanov Difference of Two Sets and Optimality Conditions of Lagrange Multiplier Type for Constrained Quasidifferentiable Optimization," Journal of Optimization Theory and Applications, Springer, vol. 104(2), pages 377-394, February.
    3. Liqun Qi, 1993. "Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 227-244, February.
    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. Yi Zhang & Liwei Zhang & Yue Wu, 2014. "The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 45-79, April.
    2. Hallaji, Majid & Dideban, Abbas & Khanesar, Mojtaba Ahmadieh & kamyad, Ali vahidyan, 2018. "Optimal synchronization of non-smooth fractional order chaotic systems with uncertainty based on extension of a numerical approach in fractional optimal control problems," Chaos, Solitons & Fractals, Elsevier, vol. 115(C), pages 325-340.

    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. Y. Gao, 2004. "Representation of the Clarke Generalized Jacobian via the Quasidifferential," Journal of Optimization Theory and Applications, Springer, vol. 123(3), pages 519-532, December.
    2. Y. Gao, 2006. "Differences of Polyhedra in Matrix Space and Their Applications to Nonsmooth Analysis," Journal of Optimization Theory and Applications, Springer, vol. 130(3), pages 431-442, September.
    3. John Duggan & Tasos Kalandrakis, 2011. "A Newton collocation method for solving dynamic bargaining games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 36(3), pages 611-650, April.
    4. H. Xu & B. M. Glover, 1997. "New Version of the Newton Method for Nonsmooth Equations," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 395-415, May.
    5. Boshi Tian & Xiaoxing Chang, 2025. "A reweighted $$\ell _1$$ ℓ 1 -penalty method for nonlinear complementarity problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 101(1), pages 95-110, February.
    6. Sanja Rapajić & Zoltan Papp, 2017. "A nonmonotone Jacobian smoothing inexact Newton method for NCP," Computational Optimization and Applications, Springer, vol. 66(3), pages 507-532, April.
    7. G. L. Zhou & L. Caccetta, 2008. "Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 379-392, November.
    8. C. Kanzow & H. Qi & L. Qi, 2003. "On the Minimum Norm Solution of Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 116(2), pages 333-345, February.
    9. Bastian Pötzl & Anton Schiela & Patrick Jaap, 2024. "Inexact proximal Newton methods in Hilbert spaces," Computational Optimization and Applications, Springer, vol. 87(1), pages 1-37, January.
    10. Kenji Ueda & Nobuo Yamashita, 2012. "Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 152(2), pages 450-467, February.
    11. Y. D. Chen & Y. Gao & Y.-J. Liu, 2010. "An Inexact SQP Newton Method for Convex SC1 Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 33-49, July.
    12. Abhishek Singh & Debdas Ghosh & Qamrul Hasan Ansari, 2024. "Inexact Newton Method for Solving Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 201(3), pages 1333-1363, June.
    13. Juan Liu & Xian-Jun Long & Xiang-Kai Sun, 2023. "Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials," Journal of Global Optimization, Springer, vol. 87(2), pages 481-501, November.
    14. J. Chen & L. Qi, 2010. "Pseudotransient Continuation for Solving Systems of Nonsmooth Equations with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 147(2), pages 223-242, November.
    15. Alain B. Zemkoho & Shenglong Zhou, 2021. "Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization," Computational Optimization and Applications, Springer, vol. 78(2), pages 625-674, March.
    16. Shaohua Pan & Jein-Shan Chen & Sangho Kum & Yongdo Lim, 2011. "The penalized Fischer-Burmeister SOC complementarity function," Computational Optimization and Applications, Springer, vol. 49(3), pages 457-491, July.
    17. Kalandrakis, Tasos, 2015. "Computation of equilibrium values in the Baron and Ferejohn bargaining model," Games and Economic Behavior, Elsevier, vol. 94(C), pages 29-38.
    18. Chen Ling & Qin Ni & Liqun Qi & Soon-Yi Wu, 2010. "A new smoothing Newton-type algorithm for semi-infinite programming," Journal of Global Optimization, Springer, vol. 47(1), pages 133-159, May.
    19. Gonglin Yuan & Zhou Sheng & Wenjie Liu, 2016. "The Modified HZ Conjugate Gradient Algorithm for Large-Scale Nonsmooth Optimization," PLOS ONE, Public Library of Science, vol. 11(10), pages 1-15, October.
    20. Beissner, Patrick & Werner, Jan, 2023. "Optimal allocations with α-MaxMin utilities, Choquet expected utilities, and Prospect Theory," Theoretical Economics, Econometric Society, vol. 18(3), July.

    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:2:p:185-279. 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.