On the conditional acceptance of iterates in SAO algorithms based on convex separable approximations
暂无分享,去创建一个
[1] J. E. Falk. Lagrange multipliers and nonlinear programming , 1967 .
[2] C. Fleury. Structural weight optimization by dual methods of convex programming , 1979 .
[3] R. Haftka,et al. Elements of Structural Optimization , 1984 .
[4] V. Braibant,et al. Structural optimization: A new dual method using mixed variables , 1986 .
[5] K. Svanberg. The method of moving asymptotes—a new method for structural optimization , 1987 .
[6] Panos Y. Papalambros,et al. Principles of Optimal Design: Modeling and Computation , 1988 .
[7] Ulf Ringertz,et al. ON METHODS FOR DISCRETE STRUCTURAL OPTIMIZATION , 1988 .
[8] J. -F. M. Barthelemy,et al. Approximation concepts for optimum structural design — a review , 1993 .
[9] Claude Fleury,et al. Mathematical Programming Methods for Constrained Optimization: Dual Methods , 1993 .
[10] Christian Zillober. A globally convergent version of the method of moving asymptotes , 1993 .
[11] N. M. Alexandrov,et al. A trust-region framework for managing the use of approximation models in optimization , 1997 .
[12] Sven Leyffer,et al. User manual for filterSQP , 1998 .
[13] Garret N. Vanderplaats,et al. Numerical optimization techniques for engineering design , 1999 .
[14] Nicholas I. M. Gould,et al. Trust Region Methods , 2000, MOS-SIAM Series on Optimization.
[15] Christian Zillober,et al. A Combined Convex Approximation—Interior Point Approach for Large Scale Nonlinear Programming , 2001 .
[16] J. Petersson,et al. Large-scale topology optimization in 3D using parallel computing , 2001 .
[17] J. Snyman,et al. The Dynamic-Q optimization method: An alternative to SQP? , 2002 .
[18] O. SIAMJ.,et al. A CLASS OF GLOBALLY CONVERGENT OPTIMIZATION METHODS BASED ON CONSERVATIVE CONVEX SEPARABLE APPROXIMATIONS∗ , 2002 .
[19] Sven Leyffer,et al. Nonlinear programming without a penalty function , 2002, Math. Program..
[20] Sven Leyffer,et al. On the Global Convergence of a Filter--SQP Algorithm , 2002, SIAM J. Optim..
[21] Nicholas I. M. Gould,et al. Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming , 2002, SIAM J. Optim..
[22] C. Fleury,et al. A family of MMA approximations for structural optimization , 2002 .
[23] Roger Fletcher,et al. On the global convergence of an SLP–filter algorithm that takes EQP steps , 2003, Math. Program..
[24] Klaus Schittkowski,et al. Very large scale optimization by sequential convex programming , 2004, Optim. Methods Softw..
[25] M. Eldred,et al. Solving the Infeasible Trust-region Problem Using Approximations. , 2004 .
[26] R. Haftka,et al. Review of options for structural design sensitivity analysis. Part 1: Linear systems , 2005 .
[27] J. Rooda,et al. Sequential Approximate Optimization in an NLP Filter Framework , 2006 .
[28] Jacobus E. Rooda,et al. Incomplete series expansion for function approximation , 2007 .
[29] A. Groenwold,et al. On the equivalence of optimality criterion and sequential approximate optimization methods in the classical topology layout problem , 2008 .
[30] A. Groenwold,et al. Sequential approximate optimization using dual subproblems based on incomplete series expansions , 2008 .
[31] Non‐convex dual forms based on exponential intervening variables, with application to weight minimization , 2009 .
[32] C. Fleury,et al. SOLUTION OF LARGE SCALE OPTIMIZATION PROBLEMS WITH SEQUENTIAL CONVEX PROGRAMMING , 2009 .
[33] Lfp Pascal Etman,et al. Globally convergent optimization algorithm using conservative convex separable diagonal quadratic approximations , 2009 .
[34] Jacobus E. Rooda,et al. On diagonal QP subproblems for sequential approximate optimization , 2009 .
[35] Derren W. Wood,et al. Approximated approximations for SAO , 2010 .