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 35 for “"Merit Function"”.

  1. A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming

    … strategy, a modified augmented Lagrangian merit function is defined in terms of the centrality condition. The second class is the Quasi-Newton interior-point methods. In this class the well known Boggs-Tolle-Wang characterization of Q-superlinear convergence for Quasi-Newton method for …

    rice Repository record for A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming (opens in a new tab)

  2. An investigation into consequences of classifying orthogonal aberrations by degree.

    … which yields the global minimum of the merit function which represents the imaging quality of the system. Currently, no satisfactory solution to this problem has been found, although a process called "simulated annealing" has shown some potential. The idea behind this research is that …

    arizona-thes Repository record for An investigation into consequences of classifying orthogonal aberrations by degree. (opens in a new tab)

  3. The design of minimum weight structures of optimum configuration

    … to optimize the design with respect to a merit function such as the weight of the structure. Minimization of the weight of a structure by optimizing the section areas of the members with a fixed geometrical configuration is a partially linear problem, in that the merit function depends …

    city-london Download PDF for The design of minimum weight structures of optimum configuration (opens in a new tab)

  4. A Trust Region Strategy for Nonlinear Equality Constrained Optimization (Nonlinear Programming, Sequential Quadratic)

    … addressed by using a line search technique and a merit function to modify the length of the step obtained from the quadratic program. In unconstrained optimization, trust region strategies have been very successful. In this thesis we present a new approach for equality constrained optimization …

    rice Repository record for A Trust Region Strategy for Nonlinear Equality Constrained Optimization (Nonlinear Programming, Sequential Quadratic) (opens in a new tab)

  5. A global convergence theory for a class of trust region algorithms for constrained optimization

    … algorithm. The augmented Lagrangian function is used as a merit function. A scheme for updating the penalty parameter is presented. The behavior of the penalty parameter is discussed. We present a global and local convergence analysis for this algorithm. We also show that under mild …

    rice Repository record for A global convergence theory for a class of trust region algorithms for constrained optimization (opens in a new tab)

  6. New Multi-Label Correlation-Based Feature Selection Methods for Multi-Label Classification and Application in Bioinformatics

    … extend the original CFS method by extending the merit function (which evaluates candidate feature subsets) to the multi-label classification scenario, as well as modifying the merit function in other ways. A conventional search strategy, hill-climbing, was used to explore the space of candidate …

    kent Download PDF for New Multi-Label Correlation-Based Feature Selection Methods for Multi-Label Classification and Application in Bioinformatics (opens in a new tab)

  7. Complexity in artificial life

    … self-replicates under perturbation and computes functions (``phenotype''). By defining a merit function over the computable functions, differential reproductive success is applied to the populations, such that they evolve to the implicit fitness landscape. Evolutionary complexity in an evolving …

    nus Repository record for Complexity in artificial life (opens in a new tab) Download file for Complexity in artificial life (opens in a new tab)

  8. Computational Complexity of Bi-clustering.

    … problem formulation, and particularly on the merit function used to evaluate the quality of a given bi-clustering partition. The computational complexity of most of the common bi-clustering problems is unknown. In this thesis, we present a formal definition for the homogeneous cover problem. …

    waterloo Repository record for Computational Complexity of Bi-clustering. (opens in a new tab)

  9. New Trust Region SQP Methods for Continuous and Integer Optimization

    … are considered. Both have in common that functions are nonlinear and the formulations contain equality and inequality constraints. For the one class of problems the domain of all variables is R. These problems are called nonlinear programming (NLP) problems. Many applications also require …

    bayreuth Repository record for New Trust Region SQP Methods for Continuous and Integer Optimization (opens in a new tab)

  10. EXTRAPOLATED LEAST SQUARES OPTIMIZATION APPLIED TO LENS DESIGN

    … refine important system parameters including the merit function, the first derivative matrix and the system metric without requiring the reevaluation of the system derivatives. This extrapolated least squares (ELS) optimization method does not simply add damping terms to the diagonal elements of …

    arizona-thes Repository record for EXTRAPOLATED LEAST SQUARES OPTIMIZATION APPLIED TO LENS DESIGN (opens in a new tab)

  11. Optimizing ship-to-shore movement for Hospital Ship humanitarian assistance operations

    … model, minimizing cost in a multi-objective merit function reflecting mission performance, personnel strength and transportation asset utilization while reflecting constraints unique to T-AH HA (flight deck limitations, restricted embarkation and debarkation by watercraft). Optimized …

    nps Repository record for Optimizing ship-to-shore movement for Hospital Ship humanitarian assistance operations (opens in a new tab)

  12. Task-based lens design, with application to digital mammography

    … way, the channelized Hotelling SNR is used as a merit function for lens design.

    arizona-thes Repository record for Task-based lens design, with application to digital mammography (opens in a new tab)

  13. Exact and inexact Newton linesearch interior-point algorithms for nonlinear programming problems

    … Tsuchiya, and Zhang. Our linesearch uses a new merit function and a new notion of centrality. We establish a global convergence theory and present rather promising numerical experimentation. In the second part, we consider an inexact Newton's method implementation of the linesearch globalization …

    rice Repository record for Exact and inexact Newton linesearch interior-point algorithms for nonlinear programming problems (opens in a new tab)

  14. Algorithm Based Metrology and Alignment Techniques for Measuring Optical Ground and Space Based Telescopes

    … sampling its wide FOV and using the multi-field merit function regression method. [2, 3, 4] Each of the topics discussed has been researched, all main concepts tested, software and hardware solutions have been developed and verified by testing. Additionally, simulations and real data have been …

    arizona-thes Repository record for Algorithm Based Metrology and Alignment Techniques for Measuring Optical Ground and Space Based Telescopes (opens in a new tab)

  15. On the optimal location of transmitters for micro-cellular radio communication system design

    … all the receivers, as measured according to some merit function. However, the nature of the latter merit or objective function, and the nature of the acceptable region for transmitter placement, imparts a special structure to the problem that distinguishes it from traditional facility location …

    vt Repository record for On the optimal location of transmitters for micro-cellular radio communication system design (opens in a new tab)

  16. Ein Zugang zum Sparse Optimization Problem durch eine Exakte Reformulierung und Penalisierung

    … by a biconvex, and in some cases even smooth, merit function. We present robust solution strategies for the penalized subproblems within the framework and substantiate our research by further successful numerical tests in the field of portfolio optimization, compressive sensing, support vector …

    wurz-thes Repository record for Ein Zugang zum Sparse Optimization Problem durch eine Exakte Reformulierung und Penalisierung (opens in a new tab)

  17. Multi-Layer Optical Memory Systems

    … designed by using numerical optimization with merit function and admittance diagram.

    arizona-thes Repository record for Multi-Layer Optical Memory Systems (opens in a new tab)

  18. A global convergence theory for a general class of trust region algorithms for equality constrained optimization

    … on the quadratic model of the Lagrangian function associated with the problem in the tangent space of the constraints. The other main characteristic of this class of algorithms is that the trial step is evaluated for acceptance by using as merit function the Fletcher exact penalty function …

    rice Repository record for A global convergence theory for a general class of trust region algorithms for equality constrained optimization (opens in a new tab)

  19. Multilevel algorithms for nonlinear equations and equality constrained optimization

    … block, and, finally, the model of the objective function, restricted to the intersection of the null spaces of all the preceding linearized constraints. The models of each constraint block and of the objective function are built by using the function and derivative information at different …

    rice Repository record for Multilevel algorithms for nonlinear equations and equality constrained optimization (opens in a new tab)

Page 1 of 2