Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 79 for “"Constraint Functions"”.

  1. Coupled Experimentally-Driven Constraint Functions and Topology Optimization utilized in Design for Additive Manufacturing

    … geometries, AM technologies still face certain constraints such as printing features at overhangs (unsupported features oriented at a certain angle from the axis normal to the build plate) and small feature sizes, amongst others. In the field of design for additive manufacturing (DfAM), it is …

    waterloo Repository record for Coupled Experimentally-Driven Constraint Functions and Topology Optimization utilized in Design for Additive Manufacturing (opens in a new tab)

  2. Bayesian Optimization Algorithms for High-Dimensional Problems and Robust Design

    … with Bayesian optimization of high-dimensional functions and optimization under uncertainty. We propose two representation learning approaches that enable Bayesian optimization algorithms to be scaled to high dimensions. The first approach, referred to as supervised function decomposition, …

    toronto-retro Repository record for Bayesian Optimization Algorithms for High-Dimensional Problems and Robust Design (opens in a new tab)

  3. Constrained stochastic differential equations

    … φ, and ƞ is a bounded variation process. The constraint is expressed by a variational inequality involving u and ƞ, and is equivalent to ƞ ∈∂Փ(u), where Փ(u) = ∫oT(ut)dt. Both ordinary and partial stochastic differential equations are considered. For ordinary equations there are minimal …

    ubc Repository record for Constrained stochastic differential equations (opens in a new tab) Download PDF for Constrained stochastic differential equations (opens in a new tab)

  4. Multiparametric Continuous and Mixed-Integer Nonlinear Optimization with Parameters in General Locations

    … been established that, when the objective and constraint functions are convex in both variables and parameters, the optimal solutions can be estimated via linear interpolation. Many applications of parametric optimization violate the necessary convexity assumption. However, the linear …

    clemson Repository record for Multiparametric Continuous and Mixed-Integer Nonlinear Optimization with Parameters in General Locations (opens in a new tab)

  5. Dynamic modeling, control and simulation of a planar five-link bipedal walking system

    … determine the joint angle profiles from a set of constraint functions for the biped to walk on a flat horizontal surface. Five new constraint functions are proposed in terms of the physical coherent parameters, one of which is to keep the total mechanical energy of the biped at constant. This …

    manitoba Repository record for Dynamic modeling, control and simulation of a planar five-link bipedal walking system (opens in a new tab)

  6. On the stress in an internally constrained elastic material

    … of invertible tensors. This submanifold, the constraint manifold, is described locally in terms of a manifold structure on the invertible tensors. Constraint functions arise naturally from the submanifold properties of the constraint manifold.

    uiuc Repository record for On the stress in an internally constrained elastic material (opens in a new tab)

  7. Quasiconvex optimization via generalized gradients and symmetric duality

    … Under certain regularity conditions on the constraint functions, we also prove that a modified version of the classical Karush-Kuhn-Tucker conditions is both necessary and sufficient for optimality. The results extend and strengthen some by Arrow and Enthoven and by Mangasarian.

    uiuc Repository record for Quasiconvex optimization via generalized gradients and symmetric duality (opens in a new tab)

  8. Discrete Optimization Models and Techniques for Problems in Data-Driven Prescriptive Analytics

    … optimization problems include objective and/or constraint functions whose explicit forms are not directly available. We focus on two complementary situations, when those unknown functions are described by pretrained tree ensembles and when we train an explicit functional form using sample data …

    umn Repository record for Discrete Optimization Models and Techniques for Problems in Data-Driven Prescriptive Analytics (opens in a new tab)

  9. Online Surrogate-Based Multi-Objective Design Optimization using Generative Adversarial Networks with Constraint Assistance

    … problems, due to the original objective and/or constraint functions of the problem being costly to evaluate. A method established in current scientific literature to reduce the computational cost for such optimization problems involves the implementation of a surrogate or a lower-cost model to …

    maryland Repository record for Online Surrogate-Based Multi-Objective Design Optimization using Generative Adversarial Networks with Constraint Assistance (opens in a new tab)

  10. Integrating surrogate modeling to improve DIRECT, DE and BA global optimization algorithms for computationally intensive problems

    … used to evaluate the objective and/or constraint functions during the MBD process also make conventional stochastic global optimization algorithms unusable due to their requirement of a huge number of objective and constraint function evaluations. Surrogate model, or metamodeling-based …

    uvic Repository record for Integrating surrogate modeling to improve DIRECT, DE and BA global optimization algorithms for computationally intensive problems (opens in a new tab)

  11. Multi-fidelity strategies for lean burn combustor design

    … reactive CFD analyses of the objective and constraint functions are normally required in combustor design and optimisation process. Hence, traditional design strategies utilizing only high-fidelity CFD analyses are often ruled out, given the complexity in obtaining accurate flow predictions …

    soton Download PDF for Multi-fidelity strategies for lean burn combustor design (opens in a new tab)

  12. Integer Programming

    … of the integrality conditions the objective and constraint functions are linear, the resulting model is called an integer linear program. Such problems are hard to solve both in theory and in practice. One common approach is to solve the continuous version of the problem and then round the …

    marquette Repository record for Integer Programming (opens in a new tab)

  13. Numerical optimization algorithm for engineering problems using micro-computer.

    … objective function and up to 50 inequality constraint functions and up to 20 bounded design variables. MSCOP employs the method of feasible directions. Although developed for microcomputers, for speed of development, the MSCOP was implemented on an IBM 3033 using standard basic language, …

    nps Repository record for Numerical optimization algorithm for engineering problems using micro-computer. (opens in a new tab)

  14. An optimization algorithm for minimum weight design of steel frames with nonsmooth stress constraints

    … optimization problems in which the stress constraints are nonsmooth. The allowable stresses of structural members may be governed by one of three types of behavior: yielding, inelastic buckling, or elastic buckling. Consequently, the strength of members is defined by a piecewise function …

    rice Repository record for An optimization algorithm for minimum weight design of steel frames with nonsmooth stress constraints (opens in a new tab)

  15. Derivative-free motion optimization for animated characters

    … adjusting it to match position and physics constraints while simultaneously optimizing it with respect to an objective function. The chief advantage our system has over similar prior work is that it requires no derivatives of the motion or objective function; the only inputs required are a …

    texas Repository record for Derivative-free motion optimization for animated characters (opens in a new tab)

  16. Application of geometric programming to PID controller tuning with state constraints

    … (PID) controller is investigated. Constraints are imposed upon the state of the system In order to obtain feasible solutions and conditions that are amenable to the geometric programming technique. The application of geometric programming requires the use of approximation procedures …

    ubc Repository record for Application of geometric programming to PID controller tuning with state constraints (opens in a new tab) Download PDF for Application of geometric programming to PID controller tuning with state constraints (opens in a new tab)

  17. An interactive graphics capability for numerical design optimization

    … as interactively modify the behavior and the constraint functions. The post processor displays variable values for three consecutive design cycle in the form of bar charts. Objective function values are plotted against the number of design cycle. Using this information the user can determine …

    njit Repository record for An interactive graphics capability for numerical design optimization (opens in a new tab)

  18. On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming

    … (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound for a QCQP with many constraints. In this thesis, we first review some important results on QCQP, like the S-Procedure, and the strength of Lagrangian …

    waterloo Repository record for On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming (opens in a new tab)

  19. A generalized trust region SQP algorithm for equality constrained optimization

    … be generated from models of the objective and constraint functions that are not necessarily based on Taylor approximations. The need for such generalizations is motivated by optimal control problems for which model problems can be generated using, e.g., different discretizations. Several …

    rice Repository record for A generalized trust region SQP algorithm for equality constrained optimization (opens in a new tab)

  20. Optimal Power Allocation for Energy Efficient MIMO Relay Systems in 5G Wireless Communication

    … channel state information (CSI) to relax the constraint functions in the standard GP form. Finally, we proposed a homotopy or continuation method based algorithm to solve the optimization problem via popular CVX optimization toolbox. MATLAB simulations are conducted to validate the proposed …

    concordia Download PDF for Optimal Power Allocation for Energy Efficient MIMO Relay Systems in 5G Wireless Communication (opens in a new tab)

Page 1 of 4