Now showing items 21-30 of 220
Spectral gradient methods for linearly constrained optimization
(Springer/plenum PublishersNew YorkEUA, 2005)
Dual convergence for penalty proximal point algorithms in convex programming
We consider an implicit iterative method in convex programming which combines inexact variants of the proximal point algorithm, with parametric penalty functions. We investigate a multiplier sequence which is explicitly ...
Interior penalty discontinuous Galerkin FEM for the $p(x)$-Laplacian
(Siam Publications, 2012-09)
In this paper we construct an “interior penalty” discontinuous Galerkin method to approximate the minimizer of a variational problem related to the $p(x)$-Laplacian. The function $p:\Omega\to [p_1,p_2]$ is log-Hölder ...
On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
(Taylor & Francis LtdAbingdonInglaterra, 2014)
Postponing the choice of penalty parameter and step length
(Kluwer Academic PublDordrechtHolanda, 2003)
Numerical comparison of Augmented Lagrangian algorithms for nonconvex problems
Penalização exata com subproblemas restritos
Penalty-based nonlinear solver for optimal reactive power dispatch with discrete controls
The optimal reactive dispatch problem is a nonlinear programming problem containing continuous and discrete control variables. Owing to the difficulty caused by discrete variables, this problem is usually solved assuming ...