SIAM Journal on Control and Optimization
Convergence analysis of some algorithms for solving nonsmooth equations
Mathematics of Operations Research
Journal of Optimization Theory and Applications
Journal of Optimization Theory and Applications
Journal of Optimization Theory and Applications
Test Examples for Nonlinear Programming Codes
Test Examples for Nonlinear Programming Codes
On the Accurate Identification of Active Constraints
SIAM Journal on Optimization
Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
Journal of Optimization Theory and Applications
Minimization of SC1 functions and the Maratos effect
Operations Research Letters
The use of QP-free algorithm in the limit analysis of slope stability
Journal of Computational and Applied Mathematics
An improved infeasible SSLE method for constrained optimization without strict complementarity
Computers and Operations Research
Hi-index | 7.29 |
In this paper, based on an l"1-l"~ hybrid exact penalty function, we proposed an infeasible SSLE method for general constrained optimization. An automatic adjustment rule is incorporated in the algorithm for the choice of the penalty parameter, which ensures that the penalty parameter be updated only finitely many times. We also extend the Facchinei-Fischer-Kanzow active-set identification technique to general constrained optimization and a corresponding identification function is given. At each iteration, only two or three reduced linear equations with the same coefficients are solved to obtain the search direction. Under the linear independence condition, the sequence generated by the new algorithm globally converges to a KKT point. In particular, the convergence rate is proved to be one-step superlinear without assuming the strict complementarity and under a condition weaker than the strong second-order sufficiency condition. Some preliminary numerical results indicate that the new algorithm is quite promising.