IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v124y2005i3d10.1007_s10957-004-1180-1.html
   My bibliography  Save this article

Implicit Smoothing and Its Application to Optimization with Piecewise Smooth Equality Constraints1

Author

Listed:
  • D. Ralph

    (University of Cambridge)

  • H. Xu

    (University of Southampton)

Abstract

In this paper, we discuss the smoothing of an implicit function defined by a nonsmooth underdetermined system of equations F(y,z) = 0. We apply a class of parametrized smoothing methods to smooth F and investigate the limiting behavior of the implicit function solving the smoothed equations. In particular, we discuss the approximation of the Clarke generalized Jacobian of the implicit function when F is piecewise smooth. As an application, we present an analysis of the generalized Karush-Kuhn-Tucker conditions of different forms for a piecewise-smooth equality-constrained minimization problem.

Suggested Citation

  • D. Ralph & H. Xu, 2005. "Implicit Smoothing and Its Application to Optimization with Piecewise Smooth Equality Constraints1," Journal of Optimization Theory and Applications, Springer, vol. 124(3), pages 673-699, March.
    • Handle: RePEc:spr:joptap:v:124:y:2005:i:3:d:10.1007_s10957-004-1180-1
    DOI: 10.1007/s10957-004-1180-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-004-1180-1
    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-004-1180-1?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. Jong-Shi Pang & Daniel Ralph, 1996. "Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps," Mathematics of Operations Research, INFORMS, vol. 21(2), pages 401-426, May.
    2. H. Xu, 2001. "Adaptive Smoothing Method, Deterministically Computable Generalized Jacobians, and the Newton Method," Journal of Optimization Theory and Applications, Springer, vol. 109(1), pages 215-224, April.
    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. Huifu Xu & Fanwen Meng, 2007. "Convergence Analysis of Sample Average Approximation Methods for a Class of Stochastic Mathematical Programs with Equality Constraints," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 648-668, August.
    2. Gui-Hua Lin & Mei-Ju Luo & Jin Zhang, 2016. "Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints," Journal of Global Optimization, Springer, vol. 66(3), pages 487-510, November.
    3. Huifu Xu & Dali Zhang, 2013. "Stochastic Nash equilibrium problems: sample average approximation and applications," Computational Optimization and Applications, Springer, vol. 55(3), pages 597-645, July.
    4. Victor DeMiguel & Huifu Xu, 2009. "A Stochastic Multiple-Leader Stackelberg Model: Analysis, Computation, and Application," Operations Research, INFORMS, vol. 57(5), pages 1220-1235, October.
    5. Pin-Bo Chen & Peng Zhang & Xide Zhu & Gui-Hua Lin, 2020. "Modified Jacobian smoothing method for nonsmooth complementarity problems," Computational Optimization and Applications, Springer, vol. 75(1), pages 207-235, January.

    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. J. Han & D. Sun, 1997. "Newton and Quasi-Newton Methods for Normal Maps with Polyhedral Sets," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 659-676, September.
    2. 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.
    3. Shenglong Hu & Guoyin Li, 2021. "$${\text {B}}$$ B -subdifferentials of the projection onto the matrix simplex," Computational Optimization and Applications, Springer, vol. 80(3), pages 915-941, December.
    4. Michael Patriksson & R. Tyrrell Rockafellar, 2002. "A Mathematical Model and Descent Algorithm for Bilevel Traffic Management," Transportation Science, INFORMS, vol. 36(3), pages 271-291, August.
    5. Axel Dreves & Christian Kanzow, 2011. "Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems," Computational Optimization and Applications, Springer, vol. 50(1), pages 23-48, September.
    6. Defeng Sun & Jie Sun, 2008. "Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 421-445, May.
    7. Dong-Hui Li & Liqun Qi & Judy Tam & Soon-Yi Wu, 2004. "A Smoothing Newton Method for Semi-Infinite Programming," Journal of Global Optimization, Springer, vol. 30(2), pages 169-194, November.
    8. Nadja Harms & Tim Hoheisel & Christian Kanzow, 2015. "On a Smooth Dual Gap Function for a Class of Player Convex Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 659-685, August.
    9. 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.
    10. Liang Chen & Anping Liao, 2020. "On the Convergence Properties of a Second-Order Augmented Lagrangian Method for Nonlinear Programming Problems with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 248-265, October.
    11. 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.
    12. Ralf Münnich & Ekkehard Sachs & Matthias Wagner, 2012. "Calibration of estimator-weights via semismooth Newton method," Journal of Global Optimization, Springer, vol. 52(3), pages 471-485, March.
    13. Y. Gao, 2006. "Newton Methods for Quasidifferentiable Equations and Their Convergence," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 417-428, December.
    14. 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.
    15. 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.
    16. M. A. Tawhid & J. L. Goffin, 2008. "On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability," Journal of Optimization Theory and Applications, Springer, vol. 139(1), pages 127-140, October.
    17. 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.
    18. Axel Dreves & Christian Kanzow & Oliver Stein, 2012. "Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems," Journal of Global Optimization, Springer, vol. 53(4), pages 587-614, August.
    19. D. H. Li & N. Yamashita & M. Fukushima, 2001. "Nonsmooth Equation Based BFGS Method for Solving KKT Systems in Mathematical Programming," Journal of Optimization Theory and Applications, Springer, vol. 109(1), pages 123-167, April.
    20. 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.

    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:124:y:2005:i:3:d:10.1007_s10957-004-1180-1. 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.