Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993 ∗
暂无分享,去创建一个
[1] R. Courant. Variational methods for the solution of problems of equilibrium and vibrations , 1943 .
[2] Georges Brigham,et al. An Analog Solution of Programming Problems , 1955, Oper. Res..
[3] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .
[4] P. Ungar,et al. Motion under a strong constraining force , 1957 .
[5] G. Dantzig,et al. THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMS , 1961 .
[6] Charles W. Carroll. The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems , 1961 .
[7] Terence Butler,et al. On a Method of Courant for Minimizing Functionals , 1962 .
[8] G. McCormick,et al. PROGRAMMING UNDER NONLINEAR CONSTRAINTS BY UNCONSTRAINED MINIMIZATION: A PRIMAL-DUAL METHOD, , 1963 .
[9] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[10] Garth P. McCormick,et al. A Guide to SUMT-Version 4: The Computer Program Implementing the Sequential Unconstrained Minimization Technique for Nonlinear Programming, , 1965 .
[11] W. Zangwill. Non-Linear Programming Via Penalty Functions , 1967 .
[12] N. Z. Shor,et al. On the minimization of nondifferentiable functions , 1967 .
[13] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[14] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .
[15] M. Powell. A method for nonlinear constraints in minimization problems , 1969 .
[16] Anthony V. Fiacco,et al. Generalized Penalty Methods in Topological Spaces , 1969 .
[17] T. Pietrzykowski. An Exact Potential Method for Constrained Maxima , 1969 .
[18] M. Hestenes. Multiplier and gradient methods , 1969 .
[19] Joseph Paul Indusi,et al. A computer algorithm for constrained minimization , 1970 .
[20] D. Luenberger. Control problems with kinks , 1970 .
[21] M. Powell. A Survey of Numerical Methods for Unconstrained Optimization , 1970 .
[22] P. C. Haarhoff,et al. A New Method for the Optimization of a Nonlinear Function Subject to Nonlinear Constraints , 1970, Comput. J..
[23] H. J. Greenberg,et al. Generalized Penalty-Function Concepts in Mathematical Optimization , 1970, Oper. Res..
[24] R. Fletcher,et al. A New Approach to Variable Metric Algorithms , 1970, Comput. J..
[25] R. Fletcher,et al. A Class of Methods for Nonlinear Programming II Computational Experience , 1970 .
[26] A. Fiacco. Penalty methods for mathematical programming inEnwith general constraint sets , 1970 .
[27] Garth P. McCormick,et al. Penalty function versus non-penalty function methods for constrained nonlinear programming problems , 1971, Math. Program..
[28] B. T. Polyak. The convergence rate of the penalty function method , 1971 .
[29] D. Luenberger. Convergence rate of a penalty-function scheme , 1971 .
[30] J. E. Nahra. Balance function for the optimal control problem , 1971 .
[31] W. Murray,et al. Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions , 1971 .
[32] Arie Tamir. On “an efficient algorithm for minimizing barrier and penalty functions” , 1972, Math. Program..
[33] D. Bertsekas,et al. A new penalty function method for constrained minimization , 1972, CDC 1972.
[34] K. Narendra,et al. Constrained optimization problems using multiplier methods , 1972 .
[35] R. D. Rupp. Approximation of the classical isoperimetric problem , 1972 .
[36] S. M. Robinson,et al. A quadratically-convergent algorithm for general nonlinear programming problems , 1972, Math. Program..
[37] A. V. Levy,et al. On the method of multipliers for mathematical programming problems , 1972 .
[38] Leon S. Lasdon,et al. An efficient algorithm for minimizing barrier and penalty functions , 1972, Math. Program..
[39] R. Rockafellar. The multiplier method of Hestenes and Powell applied to convex programming , 1973 .
[40] Roger Fletcher,et al. An exact penalty function for nonlinear programming with inequalities , 1973, Math. Program..
[41] R. Tyrrell Rockafellar,et al. Penalty Methods and Augmented Lagrangians in Nonlinear Programming , 1973, Optimization Techniques.
[42] Leon S. Lasdon,et al. An efficient one—dimensional search procedure for barrier functions , 1971, Math. Program..
[43] Philip E. Gill,et al. Numerical methods for constrained optimization , 1974 .
[44] B. Pierson,et al. A numerical study of augmented penalty function algorithms for terminally constrained optimal control problems , 1974 .
[45] William A. Gruver,et al. Implementation of Variable Metric Methods for Constrained Optimization Based on an Augmented Lagrang , 1974 .
[46] A Penalty Function Procedure for Sensitivity Analysis of Concave Programs , 1974 .
[47] D. Luenberger. A combined penalty function and gradient projection method for nonlinear programming , 1974 .
[48] Jerome Bracken,et al. Technical Note - A Method for Solving Mathematical Programs with Nonlinear Programs in the Constraints , 1974, Oper. Res..
[49] Anthony V. Fiacco,et al. Computational experience in sensitivity analysis for nonlinear programming , 1974, Math. Program..
[50] R. G. Fenton,et al. A Comparison of Numerical Optimization Methods for Engineering Design , 1974 .
[51] Yu. M. Volin. Penalty Function Method and Necessary Optimum Conditions in Optimal Control Problems with Bounded State Variables , 1974, Optimization Techniques.
[52] R. H. Hicks,et al. A nonlinear programming approach to a very large hydroelectric system optimization , 1974, Math. Program..
[53] C. Charalambous,et al. Nonlinear programming using minimax techniques , 1974 .
[54] Garth P. McCormick. A Mini-Manual for Use of the SUMT Computer Program and the Factorable Programming Language. , 1974 .
[55] R. D. Rupp. Convergence and duality for the multiplier and penalty methods , 1975 .
[56] Elijah Polak,et al. A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints , 1975, Math. Program..
[57] A. Fiacco,et al. Second-Order Parametric Sensitivity Analysis in NLP and Estimates by Penalty Function Methods, , 1975 .
[58] M. Best. A feasible conjugate-direction method to solve linearly constrained minimization problems , 1975 .
[59] J. K. Hartman. Iterative determination of parameters for an exact penalty function , 1975 .
[60] D. Himmelblau,et al. A new method for nonlinearly constrained optimization , 1975 .
[61] Dimitri P. Bertsekas,et al. Necessary and sufficient conditions for a penalty method to be exact , 1975, Math. Program..
[62] D. Bertsekas. ON PENALTY AND MULTIPLIER METHODS FOR CONSTRAINED MINIMIZATION , 1976 .
[63] J. Betts. An improved penalty function method for solving constrained parameter optimization problems , 1975 .
[64] Robert Mifflin. Convergence bounds for nonlinear programming algorithms , 1975, Math. Program..
[65] D. Bertsekas. COMBINED PRIMAL-DUAL AND PENALTY METHODS FOR CONSTRAINED MINIMIZATION* , 1975 .
[66] Ralph J Waterman. An Evaluation and Comparison of Three Nonlinear Programming Codes , 1976 .
[67] Elijah Polak,et al. On the global stabilization of locally convergent algorithms , 1976, Autom..
[68] Anthony V. Fiacco,et al. Sensitivity analysis for nonlinear programming using penalty methods , 1976, Math. Program..
[69] Ron S. Dembo,et al. A set of geometric programming test problems and their solutions , 1976, Math. Program..
[70] William B. Widhelm,et al. Acceleration of Lagrangian Column-Generation Algorithms by Penalty Function Methods , 1976 .
[71] R. Mifflin. Rates of convergence for a method of centers algorithm , 1976 .
[72] Klaus Ritter,et al. A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems , 1976 .
[73] T. L. Saaty. A Scaling Method for Priorities in Hierarchical Structures , 1977 .
[74] D. Bertsekas. Approximation procedures based on the method of multipliers , 1977 .
[75] J. Betts. An accelerated multiplier method for nonlinear programming , 1977 .
[76] R. S. Dembo. Current state of the art of algorithms and computer software for geometric programming , 1977 .
[77] Eric Sandgren. THE UTILITY OF NONLINEAR PROGRAMMING ALGORITHMS. , 1977 .
[78] Donald A. Pierre. Robust code for constrained optimization , 1977 .
[79] M. Connor,et al. A new augmented penalty function technique for optimal control problems , 1977 .
[81] M. R. Osborne,et al. Trajectory analysis and extrapolation in barrier function methods , 1978, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.
[82] M. Fukushima,et al. Penalty function theory for general convex programming problems , 1978 .
[83] G. V. Reklaitis,et al. A comparison of computational strategies for geometric programs , 1978 .
[84] Christakis Charalambous,et al. A lower bound for the controlling parameters of the exact penalty functions , 1978, Math. Program..
[85] J. B. Rosen. TWO-PHASE ALGORITHM FOR NONLINEAR CONSTRAINT PROBLEMS11This research was supported in part by the National Science Foundation grant MCS 76-23311. Support by the Systems Optimization Lab, Department of Operations Research, Stanford University, during the author's sabbatical leave, is also gratefully , 1978 .
[86] Philip E. Gill,et al. The Design and Structure of a Fortran Program Library for Optimization , 1979, TOMS.
[87] L. Grippo,et al. A New Class of Augmented Lagrangians in Nonlinear Programming , 1979 .
[88] J. Strodiot,et al. On the convergence rate for a penalty function method of exponential type , 1979 .
[89] Shih-Ping Han,et al. Penalty Lagrangian Methods Via a Quasi-Newton Approach , 1979, Math. Oper. Res..
[90] S. Glad. Properties of updating methods for the multipliers in augmented Lagrangians , 1979 .
[91] David Q. Mayne,et al. A first order, exact penalty function algorithm for equality constrained optimization problems , 1979, Math. Program..
[92] Olvi L. Mangasarian,et al. Exact penalty functions in nonlinear programming , 1979, Math. Program..
[93] Leon S. Lasdon,et al. The Status of Nonlinear Programming Software , 1979, Oper. Res..
[94] E. Polak,et al. A globally convergent, implementable multiplier method with automatic penalty limitation , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[95] R. Bartels. A penalty linear programming method using reduced-gradient basis-exchange techniques☆ , 1980 .
[96] P. Boggs,et al. Augmented Lagrangians which are quadratic in the multiplier , 1980 .
[97] K. M. Ragsdell,et al. Computational Enhancements to the Method of Multipliers , 1980 .
[98] Andrew R. Conn,et al. Second-order conditions for an exact penalty function , 1980, Math. Program..
[99] F. A. Lootsma,et al. Ranking of Non-Linear Optimization Codes According to Efficiency and Robustness , 1980 .
[100] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[101] Christakis Charalambous,et al. A Method to Overcome the Ill-Conditioning Problem of Differentiable Penalty Functions , 1980, Oper. Res..
[102] Charles E. Blair,et al. An Exact Penalty Method for Mixed-Integer Programs , 1981, Math. Oper. Res..
[103] Eric Rosenberg,et al. Globally Convergent Algorithms for Convex Programming , 1981, Math. Oper. Res..
[104] E. Sandgren,et al. On some experiments which delimit the utility of nonlinear programming methods for engineering design , 1982 .
[105] G. Hoek. Asymptotic properties of reduction methods applying linearly equality constrained reduced problems , 1982 .
[106] A. K. Rigler,et al. A penalty treatment of equality constraints in generalized geometric programming , 1982 .
[107] Andrew R. Conn,et al. Nonlinear programming via an exact penalty function: Global analysis , 1982, Math. Program..
[108] L. Grippo,et al. A new augmented Lagrangian function for inequality constraints in nonlinear programming problems , 1982 .
[109] Ronald L. Rardin,et al. Test Problems for Computational Experiments -- Issues and Techniques , 1982 .
[110] Andrew R. Conn,et al. Nonlinear programming via an exact penalty function: Asymptotic analysis , 1982, Math. Program..
[111] Gintaras V. Reklaitis,et al. On the computational utility of posynomial geometric programming solution methods , 1982, Math. Program..
[112] Dimitri P. Bertsekas,et al. Constrained Optimization and Lagrange Multiplier Methods , 1982 .
[113] P. Gill,et al. User's Guide for SOL/NPSOL: A Fortran Package for Nonlinear Programming. , 1983 .
[114] Olvi L. Mangasarian,et al. A dual differentiable exact penalty function , 1983, Math. Program..
[115] Philip E. Gill,et al. User's guide for SOL/QPSOL: a Fortran package for quadratic programming , 1983 .
[116] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[117] Michael A. Saunders,et al. On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..
[118] Earl R. Barnes,et al. A variation on Karmarkar’s algorithm for solving linear programming problems , 1986, Math. Program..
[119] Pravin M. Vaidya,et al. Fast algorithms for convex quadratic programming and multicommodity flows , 1986, STOC '86.
[120] Ya-Xiang Yuan,et al. A recursive quadratic programming algorithm that uses differentiable exact penalty functions , 1986, Math. Program..
[121] L. Grippo,et al. An exact penalty function method with global convergence properties for nonlinear programming problems , 1986, Math. Program..
[122] Salvador Pintos,et al. On differentiable exact penalty functions , 1986 .
[123] G. Sonnevend. An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .
[124] P. Gill,et al. A Note on Nonlinear Approaches to Linear Programming. , 1986 .
[125] Clyde L. Monma,et al. Computational experience with a dual affine variant of Karmarkar's method for linear programming , 1987 .
[126] Stephen J. Wright,et al. Optimization Software Guide , 1987 .
[127] G. Raiconi,et al. On the minimization of quadratic functions with bilinear constraints via augmented Lagrangians , 1987 .
[128] Jean-Philippe Vial,et al. An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex , 1987, Math. Program..
[129] Y. Censor,et al. Optimization of “log x entropy over linear equality constraints , 1987 .
[130] Michael Shub. On the asymptotic behavior of the projective rescaling algorithm for linear programming , 1987, J. Complex..
[131] J. Tomlin. An experimental approach to karmarkar’s projective method for linear programming , 1987 .
[132] Masakazu Kojima,et al. Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming , 1987, Math. Program..
[133] Leon S. Lasdon,et al. OR Practice - The Status of Nonlinear Programming Software: An Update , 1987, Oper. Res..
[134] A. B. Poore,et al. The expanded Lagrangian system for constrained optimization problems , 1988 .
[135] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .
[136] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[137] J. Birge,et al. Computing block-angular Karmarkar projections with applications to stochastic programming , 1988 .
[138] Michael J. Todd,et al. Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm , 1988, Math. Oper. Res..
[139] Luigi Grippo,et al. On the exactness of a class of nondifferentiable penalty functions , 1988 .
[140] D. E. Ward. Exact penalties and sufficient conditions for optimality in nonsmooth optimization , 1988 .
[141] Kurt M. Anstreicher,et al. Linear programming and the newton barrier flow , 1988, Math. Program..
[142] Michael J. Todd,et al. Exploiting special structure in Karmarkar's linear programming algorithm , 1988, Math. Program..
[143] C. C. Gonzaga,et al. An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations , 1989 .
[144] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..
[145] Paul D. Domich,et al. Algorithmic Enhancements to the Method of Centers for Linear Programming Problems , 1989, INFORMS J. Comput..
[146] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[147] Mauricio G. C. Resende,et al. An implementation of Karmarkar's algorithm for linear programming , 1989, Math. Program..
[148] Y. Ye. An extension of Karmarkar's algorithm and the trust region method for quadratic programming , 1989 .
[149] S. Mizuno,et al. POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS , 1989 .
[150] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..
[151] Michael C. Ferris,et al. An interior point algorithm for semi-infinite linear programming , 1989, Math. Program..
[152] Yinyu Ye,et al. An extension of Karmarkar's projective algorithm for convex quadratic programming , 1989, Math. Program..
[153] Kurt M. Anstreicher,et al. A combined phase I-phase II projective algorithm for linear programming , 1989, Math. Program..
[154] Nimrod Megiddo,et al. Boundary Behavior of Interior Point Algorithms in Linear Programming , 1989, Math. Oper. Res..
[155] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..
[156] Clóvis C. Gonzaga,et al. Conical projection algorithms for linear programming , 1989, Math. Program..
[157] S. Lucidi,et al. Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function , 1990 .
[158] Michael J. Todd,et al. A Centered Projective Algorithm for Linear Programming , 1990, Math. Oper. Res..
[159] Massimo Pappalardo,et al. Image space approach to penalty methods , 1990 .
[160] Yinyu Ye. A “build-down” scheme for linear programming , 1990, Math. Program..
[161] S. Mizuno,et al. A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS , 1990 .
[162] Sanjay Mehrotra,et al. An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations , 1990, Math. Oper. Res..
[163] Yinyu Ye,et al. Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming , 1990, Math. Oper. Res..
[164] Pravin M. Vaidya,et al. An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations , 1990, Math. Program..
[165] Shinji Mizuno,et al. Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems , 1990, Math. Oper. Res..
[166] Renato D. C. Monteiro,et al. An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence , 1990, Math. Oper. Res..
[167] J. Goffin,et al. Cutting planes and column generation techniques with the projective algorithm , 1990 .
[168] Mauricio G. C. Resende,et al. A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension , 1990, Math. Oper. Res..
[169] Richard A. Tapia,et al. Cubically convergent method for locating a nearby vertex in linear programming , 1990 .
[170] Variational metric and exponential penalization , 1990 .
[171] Michael J. Todd,et al. Containing and shrinking ellipsoids in the path-following algorithm , 1990, Math. Program..
[172] J. Burke. An exact penalization viewpoint of constrained optimization , 1991 .
[173] Y. Ye,et al. On some efficient interior point methods for nonlinear convex programming , 1991 .
[174] Renato D. C. Monteiro,et al. Limiting behavior of the affine scaling continuous trajectories for linear programming problems , 1991, Math. Program..
[175] Robert M. Freund,et al. A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming , 1991, Math. Oper. Res..
[176] Mauricio G. C. Resende,et al. An interior point algorithm to solve computationally difficult set covering problems , 1991, Math. Program..
[177] William R. Pulleyblank,et al. A network penalty method , 1991, Math. Program..
[178] Florian Jarre,et al. On the convergence of the method of analytic centers when applied to convex quadratic programs , 1991, Math. Program..
[179] Renato D. C. Monteiro,et al. Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming , 1991, Math. Oper. Res..
[180] D. Mayne,et al. Exact penalty function algorithm with simple updating of the penalty parameter , 1991 .
[181] Donald Goldfarb,et al. An O(n3L) primal interior point algorithm for convex quadratic programming , 1991, Math. Program..
[182] P. Alart,et al. Penalization in non-classical convex programming via variational convergence , 1991, Math. Program..
[183] Shinji Mizuno,et al. An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..
[184] Kees Roos,et al. A survey of search directions in interior point methods for linear programming , 1991, Math. Program..
[185] Clóvis C. Gonzaga,et al. Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method , 1991, SIAM J. Optim..
[186] Sanjay Mehrotra. On finding a vertex solution using interior point methods , 1991 .
[187] Shinji Mizuno,et al. An O(n3L) adaptive path following algorithm for a linear complementarity problem , 1991, Math. Program..
[188] P. Tseng. Global linear convergence of a path-following algorithm for some monotone variational inequality problems , 1992 .
[189] Margaret H. Wright,et al. Interior methods for constrained optimization , 1992, Acta Numerica.
[190] Katta G. Murty,et al. Exterior point algorithms for nearest points and convex quadratic programs , 1992, Math. Program..
[191] Takashi Tsuchiya,et al. Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems , 1992, Math. Oper. Res..
[192] C. Roos,et al. On the classical logarithmic barrier function method for a class of smooth convex programming problems , 1992 .
[193] Renato D. C. Monteiro. On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming , 1992, Math. Oper. Res..
[194] Roman A. Polyak,et al. Modified barrier functions (theory and methods) , 1992, Math. Program..
[195] Yinyu Ye,et al. On the finite convergence of interior-point algorithms for linear programming , 1992, Math. Program..
[196] Clóvis C. Gonzaga,et al. Path-Following Methods for Linear Programming , 1992, SIAM Rev..
[197] Uwe T. Zimmermann,et al. A combinatorial interior point method for network flow problems , 1992, Math. Program..
[198] Jishan Zhu,et al. A path following algorithm for a class of convex programming problems , 1992, ZOR Methods Model. Oper. Res..
[199] Nimrod Megiddo,et al. An interior point potential reduction algorithm for the linear complementarity problem , 1992, Math. Program..
[200] Pravin M. Vaidya,et al. A scaling technique for finding the weighted analytic center of a polytope , 1992, Math. Program..
[201] Shinji Mizuno,et al. A new polynomial time method for a linear complementarity problem , 1992, Math. Program..
[202] Michael J. Todd,et al. Solving combinatorial optimization problems using Karmarkar's algorithm , 1992, Math. Program..
[203] K. Kortanek,et al. A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier , 1992 .
[204] Michael C. Ferris,et al. On affine scaling and semi-infinite programming , 1992, Math. Program..
[205] Yinyu Ye,et al. On affine scaling algorithms for nonconvex quadratic programming , 1992, Math. Program..
[206] J. Goffin,et al. Decomposition and nondifferentiable optimization with the projective algorithm , 1992 .
[207] Garth P. McCormick,et al. Implicitly defined optimization problems , 1992, Ann. Oper. Res..
[208] Donald Goldfarb,et al. Exploiting special structure in a primal—dual path-following algorithm , 1993, Math. Program..
[209] Paul Tseng,et al. On the convergence of the exponential multiplier method for convex programming , 1993, Math. Program..
[210] Osman Güler,et al. Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems , 1993, Math. Oper. Res..
[211] Kenneth O. Kortanek,et al. A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems , 1993, Math. Oper. Res..
[212] Maïtine Bergounioux,et al. Augmented Lagrangian method for distributed optimal control problems with state constraints , 1993 .
[213] Lee J. Lehmkuhl. A Polynomial Primal-Dual Interior Point Method for Convex Programming with Quadratic Constraints , 1993 .
[214] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[215] K. O. Kortanek,et al. On controlling the parameter in the logarithmic barrier term for convex programming problems , 1995 .
[216] Kurt M. Anstreicher. On Long Step Path Following and SUMT for Linear and Quadratic Programming , 1996, SIAM J. Optim..