Skip to main content
Log in

A Unified Gradient Flow Approach to Constrained Nonlinear Optimization Problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This paper presents a unified gradient flow approach to nonlinear constrained optimization problems. This method is based on a continuous gradient flow reformulation of constrained optimization problems and on a two level time discretization of the gradient flow equation with a splitting parameter θ. The convergence of the scheme is analyzed and it is shown that the scheme becomes first order when θ ∈ [0, 1] and second order when θ = 1 and the time discretization step length is sufficiently large. Numerical experiments for continuous, discrete and mixed discrete optimization problems were performed, and the numerical results show that the approach is effective for solving these 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. T.F. Coleman and A. Verma, “A preconditioned conjugate gradient approach to linear equality constrained minimization,” Comput. Optim. Appl., vol. 20, pp. 61-72, 2001.

    Google Scholar 

  2. Y.G. Evtushenko and V.G. Zhadan, “Stable barrier-projection and barrier Newton methods in nonlinear programming,” Optimization Methods and Software, vol. 3, pp. 237-256, 1994.

    Google Scholar 

  3. Y.G. Evtushenko and V.G. Zhadan, “Stable barrier-projection and barrier Newton methods in linear programming,” Computational Optimization and Applications, vol. 3, pp. 289-303, 1994.

    Google Scholar 

  4. D. Feng and R.B. Schnabel, “Tensor methods for equality constrained optimization,” SIAM Journal on Optimization, vol. 6, pp. 653-673, 1996.

    Google Scholar 

  5. R. Fletcher, Practical Methods of Optimization, 2nd ed., Wiley: Chichester, 1987.

    Google Scholar 

  6. C.L. Lawson and R.J. Hanson, Solving Least Squares Problems, SIAM: Philadelphia, 1995.

    Google Scholar 

  7. D. Luenberger, Linear and Nonlinear Programming, 2nd ed., Addison-Wesley: Reading, MA, 1984.

    Google Scholar 

  8. D.Q. Mayne and E. Polak, “Feasible directions algorithms for optimization problems with equality and inequality constraints,” Mathematical Programming, vol. 11, pp. 67-80, 1976.

    Google Scholar 

  9. R.J. Orsi, R.E. Mahony, and J.B. Moore, “A dynamical systems analysis of semidefinite programming with application to quadratic optimization with pure equality constraints,” App. Math. Optm, vol. 40, pp. 191-210, 1999.

    Google Scholar 

  10. G.V. Smirnov, “Convergence of barrier-projection methods of optimization via vector Lyapunov functions,” Optimization Methods and Software, vol. 3, pp. 153-162, 1994.

    Google Scholar 

  11. F. Verhulst, Nonlinear Differential Equations and Dynamical Systems, Springer-Verlag: Berlin, 1990.

    Google Scholar 

  12. S. Wang, K.L. Teo, and H.W.J. Lee, “A new approach to nonlinear mixed discrete programming problems,” Eng. Opt., vol. 30, pp. 249-262, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, S., Yang, X. & Teo, K. A Unified Gradient Flow Approach to Constrained Nonlinear Optimization Problems. Computational Optimization and Applications 25, 251–268 (2003). https://doi.org/10.1023/A:1022973608903

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022973608903

Navigation