A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada

DOI10.1590/S0101-74382008000200008zbMath1257.90080MaRDI QIDQ4905610

Vanusa Alves de Sousa, Geraldo R. M. da Costa, Edméa Cássia Baptista

Publication date: 19 February 2013

Published in: Pesquisa Operacional (Search for Journal in Brave)

Full work available at URL: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382008000200008&lng=en&nrm=isoce&tlng=pt

zbMATH Keywords

Newton's methodpower systemsprimal-dual methodnonlinear programmingperturbation of constraints

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Cites Work

• Recent developments in constrained optimization
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Modified barrier functions (theory and methods)
• Feasible interior methods using slacks for nonlinear optimization
• Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
• Computational experience with penalty-barrier methods for nonlinear programming
• The Newton modified barrier method for QP problems
• Multiplier and gradient methods
• Globally convergent interior-point algorithm for nonlinear programming
• Interior Methods for Nonlinear Optimization
• A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

This page was built for publication: A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada