IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v161y2014i3d10.1007_s10957-013-0459-5.html
   My bibliography  Save this article

Feedback Stabilization Methods for the Solution of Nonlinear Programming Problems

Author

Listed:
  • Iasson Karafyllis

    (National Technical University of Athens)

Abstract

In this work, we show that, given a nonlinear programming problem, it is possible to construct a family of dynamical systems, defined on the feasible set of the given problem, so that: (a) the equilibrium points are the unknown critical points of the problem, which are asymptotically stable, (b) each dynamical system admits the objective function of the problem as a Lyapunov function, and (c) explicit formulas are available without involving the unknown critical points of the problem. The construction of the family of dynamical systems is based on the Control Lyapunov Function methodology, which is used in mathematical control theory for the construction of stabilizing feedback. The knowledge of a dynamical system with the previously mentioned properties allows the construction of algorithms, which guarantee the global convergence to the set of the critical points.

Suggested Citation

  • Iasson Karafyllis, 2014. "Feedback Stabilization Methods for the Solution of Nonlinear Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 783-806, June.
    • Handle: RePEc:spr:joptap:v:161:y:2014:i:3:d:10.1007_s10957-013-0459-5
    DOI: 10.1007/s10957-013-0459-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-013-0459-5
    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-013-0459-5?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. R. Andreani & C. E. Echagüe & M. L. Schuverdt, 2010. "Constant-Rank Condition and Second-Order Constraint Qualification," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 255-266, August.
    2. Stefan Scholtes & Michael Stöhr, 2001. "How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?," Mathematics of Operations Research, INFORMS, vol. 26(4), pages 851-863, November.
    3. Wen, Ue-Pyng & Lan, Kuen-Ming & Shih, Hsu-Shih, 2009. "A review of Hopfield neural networks for solving mathematical programming problems," European Journal of Operational Research, Elsevier, vol. 198(3), pages 675-687, November.
    4. B. S. Goh, 1997. "Algorithms for Unconstrained Optimization Problems via Control Theory," Journal of Optimization Theory and Applications, Springer, vol. 92(3), pages 581-604, March.
    Full references (including those not matched with items on IDEAS)

    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. Stefan Scholtes, 2004. "Nonconvex Structures in Nonlinear Programming," Operations Research, INFORMS, vol. 52(3), pages 368-383, June.
    2. María C. Maciel & Sandra A. Santos & Graciela N. Sottosanto, 2011. "On Second-Order Optimality Conditions for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 149(2), pages 332-351, May.
    3. Giorgio Giorgi, 2019. "Notes on Constraint Qualifications for Second-Order Optimality Conditions," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 11(5), pages 16-32, October.
    4. Giorgio, 2019. "On Second-Order Optimality Conditions in Smooth Nonlinear Programming Problems," DEM Working Papers Series 171, University of Pavia, Department of Economics and Management.
    5. Andreas Ehrenmann & Karsten Neuhoff, 2009. "A Comparison of Electricity Market Designs in Networks," Operations Research, INFORMS, vol. 57(2), pages 274-286, April.
    6. Kuang Bai & Yixia Song & Jin Zhang, 2023. "Second-Order Enhanced Optimality Conditions and Constraint Qualifications," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1264-1284, September.
    7. Aram V. Arutyunov & Alexey F. Izmailov, 2005. "Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 333-353, May.
    8. Filippo Pecci & Edo Abraham & Ivan Stoianov, 2017. "Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks," Computational Optimization and Applications, Springer, vol. 67(1), pages 201-223, May.
    9. Kaiwen Meng & Xiaoqi Yang, 2015. "First- and Second-Order Necessary Conditions Via Exact Penalty Functions," Journal of Optimization Theory and Applications, Springer, vol. 165(3), pages 720-752, June.
    10. A. Izmailov & M. Solodov, 2009. "Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints," Computational Optimization and Applications, Springer, vol. 42(2), pages 231-264, March.
    11. Bahrami, Sina & Roorda, Matthew J., 2020. "Optimal traffic management policies for mixed human and automated traffic flows," Transportation Research Part A: Policy and Practice, Elsevier, vol. 135(C), pages 130-143.
    12. Veerasamy, Veerapandiyan & Abdul Wahab, Noor Izzri & Ramachandran, Rajeswari & Othman, Mohammad Lutfi & Hizam, Hashim & Devendran, Vidhya Sagar & Irudayaraj, Andrew Xavier Raj & Vinayagam, Arangarajan, 2021. "Recurrent network based power flow solution for voltage stability assessment and improvement with distributed energy sources," Applied Energy, Elsevier, vol. 302(C).
    13. Daniel Ralph & Oliver Stein, 2011. "The C-Index: A New Stability Concept for Quadratic Programs with Complementarity Constraints," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 504-526, August.
    14. B. S. Goh, 2009. "Greatest Descent Algorithms in Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 275-289, August.
    15. Hu, X. & Ralph, R., 2006. "Using EPECs to model bilevel games in restructured electricity markets with locational prices," Cambridge Working Papers in Economics 0619, Faculty of Economics, University of Cambridge.
    16. Jayaraman Venkatesh & Alexander N. Pchelintsev & Anitha Karthikeyan & Fatemeh Parastesh & Sajad Jafari, 2023. "A Fractional-Order Memristive Two-Neuron-Based Hopfield Neuron Network: Dynamical Analysis and Application for Image Encryption," Mathematics, MDPI, vol. 11(21), pages 1-17, October.
    17. Roger Behling & Gabriel Haeser & Alberto Ramos & Daiana S. Viana, 2018. "On a Conjecture in Second-Order Optimality Conditions," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 625-633, March.
    18. Lei Guo & Gui-Hua Lin & Jane J. Ye, 2013. "Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 158(1), pages 33-64, July.
    19. Giorgio Giorgi, 2018. "A Guided Tour in Constraint Qualifications for Nonlinear Programming under Differentiability Assumptions," DEM Working Papers Series 160, University of Pavia, Department of Economics and Management.
    20. B. S. Goh, 2011. "Approximate Greatest Descent Methods for Optimization with Equality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 148(3), pages 505-527, March.

    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:161:y:2014:i:3:d:10.1007_s10957-013-0459-5. 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.