Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semi-Infinite Minimax Problems
MetadataShow full item record
Discretization algorithms for semi-infinite minimax problems replace the original problem, containing an infinite number of functions, by an approximation involving a finite number, and then solve the resulting approximate problem. The approximation gives rise to a discretization error, and suboptimal solution of the approximate problem gives rise to an optimization error. Accounting for both discretization and optimization errors, we determine the rate of convergence of discretization algorithms, as a computing budget tends to infinity. We find that the rate of convergence depends on the class of optimization algorithms used to solve the approximate problem as well as the policy for selecting discretization level and number of optimization iterations. We construct optimal policies that achieve the best possible rate of convergence and find that, under certain circumstances, the better rate is obtained by inexpensive gradient methods.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Pee, Eng Yau (Monterey, California. Naval Postgraduate School, 2011-03);This dissertation approaches the solution of optimization models with uncertain parameters by considering the worst-case value of the uncertain parameters during optimization. We consider three problems resulting from this ...
Discretely exact derivatives for hyperbolic PDE-constrained optimization problems discretized by the discontinuous Galerkin method, Draft Wilcox, Lucas C.; Stadler, Georg; Bui-Thanh, Tan; Ghattas, Omar (2013);This paper discusses the computation of derivatives for optimization problems governed by linear hyperbolic systems of partial differential equations (PDEs) that are discretized by the discontinuous Galerkin (dG) method. ...
Fahroo, Fariba; Ross, I., Michael (2001-02);In many direct methods for numerically solving optimal control problems, a collocation technique is used. What distinguishes numerous direct collocation schemes is the discretization of the time history and the way the ...