[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization

Published: 01 January 2000 Publication History

Abstract

In this paper, we propose a new QP-free method, which ensures the feasibility of all iterates, for inequality constrained optimization. The method is based on a nonsmooth equation reformulation of the KKT optimality condition, by using the Fischer--Burmeister nonlinear complementarity problem function. The study is strongly motivated by recent successful applications of this function to the complementarity problem and the variational inequality problem. The method we propose here enjoys some advantages over similar methods based on the equality part of the KKT optimality condition. For example, without assuming isolatedness of the accumulation point or boundedness of the Lagrangian multiplier approximation sequence, we show that every accumulation point of the iterative sequence generated by this method is a KKT point if the linear independence condition holds. And if the second-order sufficient condition and the strict complementarity condition hold, the method is superlinearly convergent. Some preliminary numerical results indicate that this new QP-free method is quite promising.

Cited By

View all
  • (2020)A modified nonmonotone QP-free method without penalty function or filterJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-19047538:3(3331-3342)Online publication date: 1-Jan-2020
  • (2018)A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimizationApplied Mathematics and Computation10.1016/j.amc.2017.08.013316:C(52-72)Online publication date: 1-Jan-2018
  • (2017)Feasible methods for nonconvex nonsmooth problems with applications in green communicationsMathematical Programming: Series A and B10.1007/s10107-016-1072-9164:1-2(55-90)Online publication date: 1-Jul-2017
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image SIAM Journal on Optimization
SIAM Journal on Optimization  Volume 11, Issue 1
2000
288 pages

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 2000

Author Tags

  1. QP-free method
  2. global convergence
  3. linear independence
  4. strict complementarity
  5. superlinear convergence

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2020)A modified nonmonotone QP-free method without penalty function or filterJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-19047538:3(3331-3342)Online publication date: 1-Jan-2020
  • (2018)A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimizationApplied Mathematics and Computation10.1016/j.amc.2017.08.013316:C(52-72)Online publication date: 1-Jan-2018
  • (2017)Feasible methods for nonconvex nonsmooth problems with applications in green communicationsMathematical Programming: Series A and B10.1007/s10107-016-1072-9164:1-2(55-90)Online publication date: 1-Jul-2017
  • (2015)A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraintsApplied Mathematics and Computation10.1016/j.amc.2015.07.081269:C(885-903)Online publication date: 15-Oct-2015
  • (2013)An improved infeasible SSLE method for constrained optimization without strict complementarityComputers and Operations Research10.1016/j.cor.2012.10.01240:5(1506-1515)Online publication date: 1-May-2013
  • (2011)The use of QP-free algorithm in the limit analysis of slope stabilityJournal of Computational and Applied Mathematics10.1016/j.cam.2011.01.035235:13(3889-3897)Online publication date: 1-May-2011
  • (2011)ForewordComputational Optimization and Applications10.1007/s10589-010-9382-y50:2(189-192)Online publication date: 1-Oct-2011
  • (2009)A feasible QP-free algorithm combining the interior-point method with active set for constrained optimizationComputers & Mathematics with Applications10.1016/j.camwa.2009.07.01858:8(1520-1533)Online publication date: 1-Oct-2009
  • (2009)A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimizationJournal of Computational and Applied Mathematics10.1016/j.cam.2008.07.017225:1(172-186)Online publication date: 1-Mar-2009
  • (2009)A kind of QP-free feasible methodJournal of Computational and Applied Mathematics10.1016/j.cam.2008.04.036224:1(230-241)Online publication date: 1-Feb-2009
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media