Author:
Gould Nick I. M.,Orban Dominique,Toint Philippe L.
Publisher
Springer International Publishing
Reference39 articles.
1. Armand, P.: A quasi-Newton penalty barrier method for convex minimization problems. Comput. Optim. Appl. 26(1), 5–34 (2003)
2. Armand, P., Gilbert, J.-Ch., Jan-Jégou, S.: A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach. Math. Program. 92(3), 393–424 (2000)
3. Bazaraa, M.S., Goode, J.J.: Sufficient conditions for a globally exact penalty-function without convexity. Math. Program. Stud. 19, 1–15 (1982)
4. Boman, E.G.: Infeasibility and negative curvature in optimization. Ph.D. thesis, Stanford University, Stanford (1999)
5. Byrd, R.H., Gilbert, J.-Ch., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Math. Program. A 89(1), 149–185 (2000)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献