• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 670
  • 161
  • 108
  • 62
  • 19
  • 19
  • 19
  • 19
  • 19
  • 18
  • 14
  • 7
  • 6
  • 6
  • 6
  • Tagged with
  • 1185
  • 1185
  • 218
  • 185
  • 171
  • 169
  • 163
  • 160
  • 159
  • 136
  • 135
  • 128
  • 114
  • 107
  • 87
  • 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.
11

Bottleneck problems in combinatorics and optimization

Leung, Pak-kin, Richard, 梁柏堅 January 1998 (has links)
published_or_final_version / Mathematics / Master / Master of Philosophy
12

SUBGRADIENT OPTIMIZATION METHODS FOR CAPACITY EXPANSION PLANNING.

Yakowitz, Diana Schadl. January 1983 (has links)
No description available.
13

SUCCESSIVE TWO SEGMENT SEPARABLE PROGRAMMING FOR NONLINEAR MINIMAX OPTIMIZATION.

Dunatunga, Manimelwadu Samson, 1958- January 1986 (has links)
No description available.
14

On optimality conditions, minimizing and stationary sequences for nonsmooth functions. / CUHK electronic theses & dissertations collection

January 1997 (has links)
Xinbao Li. / Thesis (Ph.D.)--Chinese University of Hong kong, 1997. / Includes bibliographical references (p. 62-64). / 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.
15

Polynomial optimization problems: approximation algorithms and applications. / CUHK electronic theses & dissertations collection

January 2011 (has links)
Li, Zhening. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 138-146). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.
16

On applied functional analysis and application in optimization theory.

January 1995 (has links)
by Tang Shu Yan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 75-76). / Introduction --- p.1 / Chapter 1 --- Efficient point and proper efficient point --- p.3 / Chapter 1.1 --- Introduction --- p.3 / Chapter 1.2 --- Definition and properties --- p.4 / Chapter 1.3 --- Existence of bases and proper efficient points --- p.14 / Chapter 2 --- Density theorem for positive proper efficient point in normed space --- p.18 / Chapter 2.1 --- "Theorem of Arrrow, Barankin and Blackwell" --- p.18 / Chapter 2.2 --- Cone with strictly positive linear functionals --- p.20 / Chapter 2.3 --- Cone with closed bounded base --- p.25 / Chapter 2.4 --- Density theorem for other proper efficiency --- p.34 / Chapter 3 --- Density theorem in Topological Vector Space --- p.43 / Chapter 3.1 --- D-cone --- p.43 / Chapter 3.2 --- Space ordered by a D-cone --- p.47 / Chapter 3.3 --- Space ordered by a cone with closed bounded base --- p.49 / Chapter 4 --- Some results on multifunction --- p.52 / Chapter 4.1 --- Open mapping theorem --- p.53 / Chapter 4.2 --- Inverse function theorem --- p.63 / Chapter 4.3 --- Subtraction theorem --- p.66 / Bibliography
17

Nonsmooth optimization with constraints.

January 1987 (has links)
by Chow Wai Chuen. / Thesis (M.Ph.)--Chinese University of Hong Kong, 1987. / Bibliography: leaves 66-67.
18

Some problems in optimal periodic control.

January 1978 (has links)
by Ng Sze-Kui. / Thesis (M.Phil.)--Chinese University of Hong Kong. / Bibliography: leaf 42.
19

Topics in optimization and vector optimization.

January 1999 (has links)
by Peter Au. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 87-88). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.5 / Chapter 2 --- Preliminaries --- p.7 / Chapter 2.1 --- Recession and Conjugate Functions --- p.7 / Chapter 2.2 --- Directional derivative and Subgradient --- p.10 / Chapter 2.3 --- Well-Posedness and E-subgradient --- p.15 / Chapter 2.4 --- Exact Penalization --- p.17 / Chapter 3 --- Some Recent Results on Error Bounds --- p.20 / Chapter 3.1 --- Hoffman's Error Bound --- p.20 / Chapter 3.2 --- Extension of Hoffman's Error Bound to Polynomial Systems --- p.26 / Chapter 3.2.1 --- An Error Bound to Polynomial Systems --- p.28 / Chapter 3.2.2 --- Error Bound for Convex Quadratic Inequali- ties Systems --- p.30 / Chapter 3.3 --- Error Bounds for a Convex Inequality --- p.41 / Chapter 3.3.1 --- Unconstrained Case --- p.42 / Chapter 3.3.2 --- Constrained Case --- p.47 / Chapter 3.4 --- Error Bounds for System of Convex Inequalities --- p.55 / Chapter 3.4.1 --- Unconstrained Case --- p.56 / Chapter 3.4.2 --- Constrained Case --- p.60 / Chapter 4 --- Some Recent Results on Certain Proper Efficient Points --- p.63 / Chapter 4.1 --- Scalarization of Henig Proper Efficient Points --- p.63 / Chapter 4.1.1 --- Preliminaries --- p.64 / Chapter 4.1.2 --- Scalarization by Monotone Minkowski Func- tionals --- p.68 / Chapter 4.1.3 --- Scalarization by Continuous Norms --- p.73 / Chapter 4.2 --- Pareto Optimizing and Scalarly Stationary Sequence --- p.75 / Bibliography
20

Histogram techniques for cost estimation in query optimization.

January 2001 (has links)
Yu Xiaohui. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 98-115). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Related Work --- p.6 / Chapter 2.1 --- Query Optimization --- p.6 / Chapter 2.2 --- Query Rewriting --- p.8 / Chapter 2.2.1 --- Optimizing Multi-Block Queries --- p.8 / Chapter 2.2.2 --- Semantic Query Optimization --- p.13 / Chapter 2.2.3 --- Query Rewriting in Starburst --- p.15 / Chapter 2.3 --- Plan Generation --- p.16 / Chapter 2.3.1 --- Dynamic Programming Approach --- p.16 / Chapter 2.3.2 --- Join Query Processing --- p.17 / Chapter 2.3.3 --- Queries with Aggregates --- p.23 / Chapter 2.4 --- Statistics and Cost Estimation --- p.24 / Chapter 2.5 --- Histogram Techniques --- p.27 / Chapter 2.5.1 --- Definitions --- p.28 / Chapter 2.5.2 --- Trivial Histograms --- p.29 / Chapter 2.5.3 --- Heuristic-based Histograms --- p.29 / Chapter 2.5.4 --- V-Optimal Histograms --- p.32 / Chapter 2.5.5 --- Wavelet-based Histograms --- p.35 / Chapter 2.5.6 --- Multidimensional Histograms --- p.35 / Chapter 2.5.7 --- Global Histograms --- p.37 / Chapter 3 --- New Histogram Techniques --- p.39 / Chapter 3.1 --- Piecewise Linear Histograms --- p.39 / Chapter 3.1.1 --- Construction --- p.41 / Chapter 3.1.2 --- Usage --- p.43 / Chapter 3.1.3 --- Error Measures --- p.43 / Chapter 3.1.4 --- Experiments --- p.45 / Chapter 3.1.5 --- Conclusion --- p.51 / Chapter 3.2 --- A-Optimal Histograms --- p.54 / Chapter 3.2.1 --- A-Optimal(mean) Histograms --- p.56 / Chapter 3.2.2 --- A-Optimal(median) Histograms --- p.58 / Chapter 3.2.3 --- A-Optimal(median-cf) Histograms --- p.59 / Chapter 3.2.4 --- Experiments --- p.60 / Chapter 4 --- Global Histograms --- p.64 / Chapter 4.1 --- Wavelet-based Global Histograms --- p.65 / Chapter 4.1.1 --- Wavelet-based Global Histograms I --- p.66 / Chapter 4.1.2 --- Wavelet-based Global Histograms II --- p.68 / Chapter 4.2 --- Piecewise Linear Global Histograms --- p.70 / Chapter 4.3 --- A-Optimal Global Histograms --- p.72 / Chapter 4.3.1 --- Experiments --- p.74 / Chapter 5 --- Dynamic Maintenance --- p.81 / Chapter 5.1 --- Problem Definition --- p.83 / Chapter 5.2 --- Refining Bucket Coefficients --- p.84 / Chapter 5.3 --- Restructuring --- p.86 / Chapter 5.4 --- Experiments --- p.91 / Chapter 6 --- Conclusions --- p.95 / Bibliography --- p.98

Page generated in 0.1467 seconds