Skip to main content

Advertisement

Log in

A new method of moving asymptotes for large-scale linearly equality-constrained minimization

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

A new method of moving asymptotes for large-scale minimization subject to linear equality constraints is discussed. In this method, linear equality constraints are deleted with null space technique and the descending direction is obtained by solving a convex separable subproblem of moving asymptotes in each iteration. New rules for controlling the asymptotes parameters are designed and the global convergence of the method under some reasonable conditions is established and proved. The numerical results show that the new method may be capable of processing some large scale problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Andrei, N. Unconstrained Optimization Test Functions. http://www.ici.ro/camo/neculai/t1.pdf, April 28, 2005

  2. Bletzinger, K.U. Extended method of moving asymptotes based on second-order information structural optimization. Structural Optimization, 5: 175–183 (1993)

    Article  Google Scholar 

  3. Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, P.L. CUTE: Constrained and unconstrained testing environments. ACM Trans. Math. Softw., 21: 123–160 (1995)

    Article  MATH  Google Scholar 

  4. Dai, Y., Fletcher, R. Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numerische Mathematik, 100(1): 21–47 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dai, Y. Alternate step gradient method. Optimization, 52: 395–415 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ni, Q. A globally convergent method of moving asymptotes with trust region technique. Optimization Methods and Software, 18: 283–297 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Schittkowski, K., Zillober, C., Zotemantel, R. Numerical comparison of nonlinear programming algorithms for structural optimization. Structural Optimization, 7: 1–19 (1994)

    Article  Google Scholar 

  8. Sun, W., Yuan, Y. Optimization theory and methods. Series: Springer Optimization and Its Applications, Vol.1, 2006

  9. Svanberg, K. The method of moving asymptotes-a new method for structural optimization. Int. J. Numer. Methods. Eng., 24: 359–373 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  10. Svanberg, K. The method of moving asymptotes (MMA) with some extensions. Lecture notes for the NATO/DFG ASI ‘Optimization of Large Structural Systems”, Berchtesgaden, Germany, 23 September–4 October, 1991

  11. Svanberg, K. The method of moving asymptotes (MMA) with some extension. In: G.I.N. Rozvany (Ed.), Optimization of Large Structural Systems, 1993, 555–566

  12. Wang, H., Ni, Q. A new method of moving asymptotes for large-scale unconstrained optimization. Applied Mathematics and Computation, 203: 62–71 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Zillober, C. A globally convergent version of the method of moving asymptotes. Structural Optimization, 6: 166–174 (1993)

    Article  Google Scholar 

  14. Zillober, C. Global convergence of a nonlinear programming method using convex approximations. Numerical Algorithms, 27: 256–289 (2001)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hai-jun Wang.

Additional information

Supported by the National Natural Sicence Foundation of China (No. 11071117), the Natural Science Foundation of Jiangsu Province (No. BK2006184) and the Fundamental Research Funds for the Central Universities (No. 2010LKSX01).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Hj., Ni, Q. & Liu, H. A new method of moving asymptotes for large-scale linearly equality-constrained minimization. Acta Math. Appl. Sin. Engl. Ser. 27, 317–328 (2011). https://doi.org/10.1007/s10255-011-0065-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-011-0065-y

Keywords

2000 MR Subject Classification

Navigation