A primal-dual trust-region algorithm for minimizing a non-convex function subject to general inequality and linear equality constraints

Ejemplares similares

• A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints
  por: Conn, A R, et al.
  Publicado: (1996)
• Convergence properties of an augmented lagrangian algorithm for optimization with a combination of general equality and linear constraints
  por: Conn, A R, et al.
  Publicado: (1995)
• Methods for nonlinear constraints in optimization calculations
  por: Conn, A R, et al.
  Publicado: (1996)
• On iterated-subspace minimization methods for nonlinear optimization
  por: Conn, A R, et al.
  Publicado: (1994)
• Global convergence of a non-monotone trust-region filter algorithm for nonlinear programming
  por: Gould, N I M, et al.
  Publicado: (2003)