Now showing items 1-8 of 8
User's Guide for ADIFFSQP Version 0.91
ADIFFSQP is a utility program that allows to user of the FFSQP constrained nonlinear optimization routines to invoke the computational differentiation (or automatic differentiation:AD) preprocessor ADIFOR2.0  conveniently
Absolute Stability Theory, Theory, and State-Space Verification of Frequency-Domain Conditions: Connections and Implications for Computation
The main contribution of the paper is to show the equivalence between the following two approaches for obtaining sufficient conditions for the robust stability of systems with structured uncertainties: (i) apply the classical ...
A New Class of Six-Bar Mechanisms with Symmetrical Coupler Curves
A new class of six-bar mechanisms with symmetrical coupler-point curves is presented. This class of mechanisms is made up of a four-bar linkage with an additional dyad to form an embedded regular or skew pantograph. Because ...
Multiobjective Optimization of a Leg Mechanism with Various Spring Configurations for Force Reduction
In this paper, the design of a two degree-of-freedom leg mechanism is accomplished by a two-stage optimization process. In the first stage, leg dimensions are optimized with respect to three design objectives: minimize (i) ...
Robustness under Bounded Uncertainty with Phase Information
We consider uncertain linear systems where the uncertainties, in addition to being bounded, also satisfy constraints on their phase. In this context, we define the ﲰhase-sensitive structured singular value (PS-SSV) of a ...
Nonlinear Equality Constraints in Feasible Sequential Quadratic Programming
A simple scheme is proposed for handling nonlinear equality constraints in the context of a previously introduced sequential quadratic programming (SQP) algorithm for inequality constrained problems, generating iterates ...
Feasible Sequential Quadratic Programming for Finely Discretized Problems from SIP
A sequential Quadratic Programming algorithm designed to efficiently solve nonlinear optimization problems with many inequality constraints, e.g. problems arising from finely discretized Semi-Infinite Programming, is ...
Globally Convergent Algorithms for Robust Pole Assignment by State Feedback
It is observed that an algorithm proposed in 1985 by Kautsky, Nichols and Van Dooren (KNV) amounts to maximize, at each iteration, the determinant of the candidate closed-loop eigenvector matrix X with respect to one of ...