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 19 of 19 for “"Equality constrained optimization"”.
-
Multilevel algorithms for nonlinear equations and equality constrained optimization
… for solving nonlinear systems of equations and equality constrained optimization problems by means of multilevel algorithms. The idea is to use the trust region strategy to globalize the Brent algorithms for solving nonlinear equations, and to extend them to algorithms for solving optimization …
-
A generalized trust region SQP algorithm for equality constrained optimization
… quadratic programming (GTRSQP) algorithms for equality constrained optimization. Unlike in standard trust region SQP (TRSQP) algorithms, the optimization subproblems arising in our GTRSQP algorithm can be generated from models of the objective and constraint functions that are not necessarily …
-
A Trust Region Strategy for Nonlinear Equality Constrained Optimization (Nonlinear Programming, Sequential Quadratic)
Many current algorithms for nonlinear constrained optimization problems determine a search direction by solving a quadratic programming subproblem. The global convergence properties are addressed by using a line search technique and a merit function to modify the length of the step obtained from …
-
A global convergence theory for a general class of trust region algorithms for equality constrained optimization
… the smooth nonlinear programming problem with equality constraints. The family of algorithms to which our results apply is characterized by very mild conditions on the normal and tangential components of the steps that its members generate. The normal component must predict a fraction of Cauchy …
-
Large scale optimization for machine learning
… risk minimization problems, large scale optimization plays a key role in building a large scale machine learning system. However, scaling optimization algorithms like stochastic gradient descent (SGD) in a distributed system raises some issues like synchronization since they were not …
-
Convergence rates for the variable, the multiplier, and the pair in SQP methods
… for the pair ($x,\lambda$) in SQP methods for equality constrained optimization. We show that if the convergence in ($x,\lambda$) is $q$-superlinear, then the convergence in $x$ is at least two-step $q$-superlinear. Moreover, if the convergence in ($x,\lambda$) and also in $x$ is …
-
A global convergence theory for a class of trust region algorithms for constrained optimization
… present a trust region algorithm for solving the equality constrained optimization problem. This algorithm is a variant of the 1984 Celis-Dennis-Tapia algorithm. The augmented Lagrangian function is used as a merit function. A scheme for updating the penalty parameter is presented. The behavior of …
-
A robust choice of the Lagrange multipliers in the successive quadratic programming method
… programming method (SQP) applied to the equality constrained optimization problem. It is known that the augmented Lagrangian SQP-Newton method depends on the penalty parameter only through the multiplier in the Hessian matrix of the Lagrangian function. This effectively reduces the …
-
A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming
… convergence for Quasi-Newton method for equality constrained optimization is extended. Critical issues in this extension are; the choice of the centering parameter, the choice of the steplength parameter, and the choice of the primary variables.
-
Local and superlinear convergence of structured secant methods from the convex class
… which use updates from the convex class for the equality-constrained optimization problem and the nonlinear least-squares problem. Particular cases of these methods are the SQP augmented scale BFGS and DFP secant methods for constrained optimization problems introduced by Tapia. Another …
-
A structured reduced sequential quadratic programming and its application to a shape design problem
… duct design problem using a particular optimization method. The design problem is formulated as an equality constrained optimization, called All at once method, so that the analysis problem is not solved until the optimal design is reached. Furthermore, the block structure in the …
-
A robust trust region algorithm for nonlinear programming
… tests a trust region algorithm for the nonlinear equality constrained optimization problem. Our goal is to develop a robust algorithm that can handle lack of second-order sufficiency away from the solution in a natural way. Celis, Dennis and Tapia (1985) give a trust region algorithm for this …
-
Sensitivity analysis of a multi-parameter performance function and application to a nuclear rocket engine system.
… in many areas of engineering. Parameter optimization codes have been written for that purpose, and make it possible for a design engineer, once he has developed the mathematics of a system, to optimize its parameters according to some criteria. But of equal interest to the design engineer …
-
Trust-region interior-point algorithms for a class of nonlinear programming problems
… solution of minimization problems with nonlinear equality constraints and simple bounds on some of the variables. These nonlinear programming problems appear in applications in control, design, parameter identification, and inversion. In particular they often arise in the discretization of optimal …
-
An Optimal Control Approach to Implant Shape Design : Modeling, Analysis and Numerics
… is concerned with the efficient solution and optimization of realistic models. This includes recent material laws for different soft tissue types as well as complex geometries attained from medical image data. The implant shape design problem can be described as an optimal control problem with …
-
Matrix Polynomials and their Lower Rank Approximations
… matrix polynomial using second-order non-linear optimization techniques. Two notions of rank are investigated. The first is the rank as the number of linearly independent rows or columns, which is the classical definition. The other notion considered is the lowest rank of a matrix polynomial when …
-
Dynamics and optimal control of information transmission in complex systems
… lifetimes. In Part II, we develop tools for constrained design optimization that are motivated by i) the natural decomposition of some optimal control problems into weakly coupled sub-problems and ii) an initialization-free solution strategy based on principles of parameter continuation. The …
-
Time-varying optimization using primal-dual type methods: Solution tracking and model training
… dissertation considers general time-varying optimization problems that arise in many network control and machine learning applications. The problem takes the form of minimizing the sum of separable convex/non-convex cost functions subject to equality constraints, and both the objective and …