Two Logarithmic Barrier Methods for Convex Semi-Infinite Problems
暂无分享,去创建一个
[1] E. Polak. On the mathematical foundations of nondifferentiable optimization in engineering design , 1987 .
[2] Krzysztof C. Kiwiel,et al. Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities , 1995, Math. Program..
[3] G. Sonnevend. A new class of a high order interior point method for the solution of convex semiinfinite optimization problems , 1994 .
[4] Michael C. Ferris,et al. An interior point algorithm for semi-infinite linear programming , 1989, Math. Program..
[5] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[6] Pierre Moulin,et al. Semi-Infinite Programming in Orthogonal Wavelet Filter Design , 1998 .
[7] Margaret H. Wright,et al. Interior methods for constrained optimization , 1992, Acta Numerica.
[8] R. Fletcher. A General Quadratic Programming Algorithm , 1971 .
[9] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[10] A. Kaplan,et al. Proximal interior point approach in convex programming (ill-posed problems) * † , 1999 .
[11] Ulrich Schättler,et al. An interior-point method for semi-infinite programming problems , 1996, Ann. Oper. Res..
[12] G. Sonnevend. Applications of analytic centers for the numerical solution of semiinfinite, convex programs arising in control theory , 1990 .
[13] J. Henry,et al. System Modelling and Optimization: Proceedings of the 16th IFIP-TC7 Conference, Compiègne, France, July 5-9, 1993 , 1994, System Modelling and Optimization.
[14] Kenneth O. Kortanek,et al. Semi-Infinite Programming and Applications , 1983, ISMP.
[15] Michael J. Todd,et al. Interior-point algorithms for semi-infinite programming , 1994, Math. Program..