Sciweavers

Share
ICASSP
2011
IEEE
9 years 3 months ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan
OL
2011
332views Neural Networks» more  OL 2011»
9 years 6 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski
EUSFLAT
2009
155views Fuzzy Logic» more  EUSFLAT 2009»
9 years 9 months ago
A Generalized Numerical Solution for Fuzzy Relation Equations
In this paper, line search based on Sequential Quadratic Programming is implemented in order to find a solution to Fuzzy Relation Equations. Sequential Quadratic Programming is a g...
Iman Mohammadi Ardehali, Milad Avazbeigi
SIAMJO
2010
87views more  SIAMJO 2010»
9 years 10 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
SIAMJO
2002
133views more  SIAMJO 2002»
9 years 11 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
SIAMJO
2000
108views more  SIAMJO 2000»
9 years 11 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
SIAMJO
2008
114views more  SIAMJO 2008»
9 years 11 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
ICRA
1995
IEEE
122views Robotics» more  ICRA 1995»
10 years 3 months ago
Actuator Constraints in Optimal Motion Planning of Manipulators
The optimal motion generation problem is solved subject to various actuator constraints while the motion is constrained to an arbitrary path. The considered objective function is ...
Patrick Plédel, Yasmina Bestaoui
IFIP
2005
Springer
10 years 5 months ago
A New Low Rank Quasi-Newton Update Scheme for Nonlinear Programming
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
R. Fletcher
DAC
2006
ACM
10 years 5 months ago
Clock buffer and wire sizing using sequential programming
This paper investigates methods for clock skew minimization using buffer and wire sizing. First, a technique that significantly improves solution quality and stability of sequent...
Matthew R. Guthaus, Dennis Sylvester, Richard B. B...
books