32 search results - page 2 / 7 » An Inexact SQP Method for Equality Constrained Optimization |
SIAMSC
2010
12 years 11 months ago
2010
We present a line-search algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices. Inste...
SIAMJO
2002
13 years 4 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
CEC
2008
IEEE
13 years 11 months ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
SIAMJO
2010
13 years 3 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we consider the issue of energy efficiency in random access networks and show that optimizing transmission probabilities of nodes can enhance network performance in t...