• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 117
  • 72
  • 15
  • 6
  • 4
  • 4
  • 4
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 255
  • 255
  • 129
  • 112
  • 108
  • 99
  • 56
  • 50
  • 40
  • 38
  • 35
  • 33
  • 30
  • 29
  • 27
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Interior point methods for convex optimization

Lin, Chin-Yee 05 1900 (has links)
No description available.

Linearly constrained nonlinear programming : a conjugate directions approach

Bouzaher, Abdelaziz 12 1900 (has links)
No description available.

Quadratic programming : quantitative analysis and polynomial running time algorithms

Boljunčić, Jadranka January 1987 (has links)
Many problems in economics, statistics and numerical analysis can be formulated as the optimization of a convex quadratic function over a polyhedral set. A polynomial algorithm for solving convex quadratic programming problems was first developed by Kozlov at al. (1979). Tardos (1986) was the first to present a polynomial algorithm for solving linear programming problems in which the number of arithmetic steps depends only on the size of the numbers in the constraint matrix and is independent of the size of the numbers in the right hand side and the cost coefficients. In the first part of the thesis we extended Tardos' results to strictly convex quadratic programming of the form max {cTx-½xTDx : Ax ≤ b, x ≥0} with D being symmetric positive definite matrix. In our algorithm the number of arithmetic steps is independent of c and b but depends on the size of the entries of the matrices A and D. Another part of the thesis is concerned with proximity and sensitivity of integer and mixed-integer quadratic programs. We have shown that for any optimal solution z̅ for a given separable quadratic integer programming problem there exist an optimal solution x̅ for its continuous relaxation such that / z̅ - x̅ / ∞≤n∆(A) where n is the number of variables and ∆(A) is the largest absolute sub-determinant of the integer constraint matrix A . We have further shown that for any feasible solution z, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution z̅ having greater objective function value and with / z - z̅ / ∞≤n∆(A). Under some additional assumptions the distance between a pair of optimal solutions to the integer quadratic programming problem with right hand side vectors b and b', respectively, depends linearly on / b — b' / ₁. The extension to the mixed-integer nonseparable quadratic case is also given. Some sensitivity analysis results for nonlinear integer programming problems are given. We assume that the nonlinear 0 — 1 problem was solved by implicit enumeration and that some small changes have been made in the right hand side or objective function coefficients. We then established what additional information to keep in the implicit enumeration tree, when solving the original problem, in order to provide us with bounds on the optimal value of a perturbed problem. Also, suppose that after solving the original problem to optimality the problem was enlarged by introducing a new 0 — 1 variable, say xn+1. We determined a lower bound on the added objective function coefficients for which the new integer variable xn+1 remains at zero level in the optimal solution for the modified integer nonlinear program. We discuss the extensions to the mixed-integer case as well as to the case when integer variables are not restricted to be 0 or 1. The computational results for an example with quadratic objective function, linear constraints and 0—1 variables are provided. Finally, we have shown how to replace the objective function of a quadratic program with 0—1 variables ( by an integer objective function whose size is polynomially bounded by the number of variables) without changing the set of optimal solutions. This was done by making use of the algorithm given by Frank and Tardos (1985) which in turn uses the simultaneous approximation algorithm of Lenstra, Lenstra and Lovász (1982). / Business, Sauder School of / Graduate

Convergent Lagrangian in separable nonlinear integer programming: cutting methods. / CUHK electronic theses & dissertations collection

January 2003 (has links)
Wang Jun. / "February 2003." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (p. 116-124). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

A continuous nonlinear programming problem /

Silver, Jerry Lee January 1971 (has links)
No description available.

Some aspects of stability in nonlinear programming

Wolkewicz, Gail S. K., 1950- January 1978 (has links)
No description available.

Nonlinear programming techniques for the multiple response program

Fields, Timothy George 05 1900 (has links)
No description available.

Applications of parallel processing to optimization

Handley-Schachler, Sybille H. January 1994 (has links)
No description available.

Solution of nonlinear least-squares problems /

Fraley, Christina. January 1987 (has links)
Thesis (Ph. D.)--Stanford University, 1987. / "June 1987." This research was supported in part by Joseph Oliger under Office of Naval Research contract N00014-82-K-0335, by Stanford Linear Accelerator Center and the Systems Optimization Laboratory under Army Research Office contract DAAG29-84-K-0156. Includes bibliographies.

Barrier function algorithms for linear and convex quadratic programming

Ben Daya, Mohamed 12 1900 (has links)
No description available.

Page generated in 0.1934 seconds