A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints
暂无分享,去创建一个
[1] J. H. Wilkinson. The algebraic eigenvalue problem , 1966 .
[2] S. M. Robinson,et al. A quadratically-convergent algorithm for general nonlinear programming problems , 1972, Math. Program..
[3] Michael A. Saunders,et al. Large-scale linearly constrained optimization , 1978, Math. Program..
[4] John K. Reid,et al. The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.
[5] Nicholas I. M. Gould,et al. On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem , 1985, Math. Program..
[6] P. Gill,et al. A Schur-complement method for sparse quadratic programming , 1987 .
[7] P. Toint,et al. Global convergence of a class of trust region algorithms for optimization with simple bounds , 1988 .
[8] I. Duff,et al. The factorization of sparse symmetric indefinite matrices , 1991 .
[9] P. Gill,et al. Solving Reduced KKT Systems in Barrier Methods for Linear and Quadratic Programming , 1991 .
[10] D. Ponceleón. Barrier methods for large-scale quadratic programming , 1991 .
[11] N. Gould. An Algorithm for Large-Scale Quadratic Programming , 1991 .
[12] J. H. Wilkinson,et al. Reliable Numerical Computation. , 1992 .
[13] Ai-Ping Liao. Algorithms for linear programming via weighted centers , 1992 .
[14] P. Toint,et al. Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .
[15] Stephen J. Wright. An Interior-Point Algorithm for Linearly Constrained Optimization , 1992, SIAM J. Optim..
[16] Sanjay Mehrotra,et al. Solving symmetric indefinite systems in an interior-point method for linear programming , 1993, Math. Program..
[17] John M. Mulvey,et al. Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives , 1993, SIAM J. Optim..
[18] Robert J. Vanderbei,et al. Symmetric indefinite systems for interior point methods , 1993, Math. Program..
[19] W. Murray,et al. Newton methods for large-scale linear equality-constrained minimization , 1993 .
[20] D. G. Rogers. Improved Bounds for Perfect Systems of Difference Sets , 1993, J. Comb. Theory, Ser. A.
[21] E. Spedicato. Algorithms for continuous optimization : the state of the art , 1994 .
[22] Yin Zhang,et al. Superlinear convergence of infeasible-interior-point methods for linear programming , 1994, Math. Program..
[23] Michael A. Saunders,et al. Primal—dual methods for linear programming , 1995, Math. Program..
[24] Nicholas I. M. Gould,et al. CUTE: constrained and unconstrained testing environment , 1995, TOMS.
[25] Jacek Gondzio,et al. Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .
[26] Nicholas I. M. Gould,et al. Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization , 1996, Math. Program..
[27] Nicholas I. M. Gould,et al. Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints , 1996, SIAM J. Optim..
[28] K. M. Anstreicher,et al. Interior point methods in mathematical programming , 1996 .
[29] Joseph R. Shinnerl,et al. Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization , 1996, SIAM J. Matrix Anal. Appl..
[30] David F. Shanno,et al. An Infeasible-Interior-Point Method for Linear Complementarity Problems , 1997, SIAM J. Optim..
[31] J. Frédéric Bonnans,et al. A Trust Region Interior Point Algorithm for Linearly Constrained Optimization , 1997, SIAM J. Optim..
[32] Nicholas J. Higham,et al. Modifying the inertia of matrices arising in optimization , 1998 .
[33] Anders Forsgren,et al. Primal-Dual Interior Methods for Nonconvex Nonlinear Programming , 1998, SIAM J. Optim..