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 130 for “"subgradient"”.
-
Inexact subgradient methods.
… evaluation of the objective function and its subgradients can be computationally burdensome. For example, in a stochastic program, the objective function is typically defined through a multi-dimensional integration. Solution procedures for stochastic programs are usually based on functional …
-
Subgradient projectors : theory, extensions and algorithms
The subgradient projector plays an important role in convex optimization, since the subgradient projection algorithm is a classical method for solving convex feasibility problems. This motivates us to explore fundamental properties of the subgradient projector. One can define the subgradient …
-
Bregman generalized subgradient projected algorithms and applications
Projected subgradient methods were thought as ideal algorithms for constrained minimization problems. But they are often hampered by the computational complexity of the projection operator. The generalized Bregman distance has been identified as a potential solution to this issue. This thesis …
-
Subgradient formulas for optimal control problems with constant dynamics
… We show that the Proximal and Fréchet subgradients of the minimal time function are computed in terms of normal vectors to level sets. And we also computed the subgradients of the minimal time function in terms of the F-projection. Secondly, we consider the value function for Bolza …
-
SOME PRIMAL-DUAL THEORY FOR SUBGRADIENT METHODS FOR STRONGLY CONVEX OPTIMIZATION
We consider (stochastic) subgradient methods for strongly convex but potentially nonsmooth non-Lipschitz optimization. We provide new equivalent dual descriptions (in the style of dual averaging) for the classic subgradient method, the proximal subgradient method, and the switching subgradient …
-
PRIMAL-DUAL THEORY FOR THE SUBGRADIENT METHOD IN WEAKLY-CONVEX OPTIMIZATION
Davis at al. prove the convergence rate of the subgradient method on weakly-convex functions to be O(k^−1/4). Still, the reliable stopping criterion remained unknown. This thesis establishes several computable stopping criteria from a new equivalent dual description for the classical subgradient …
-
An inexact deflected subgradient algorithm with applications to optimal control problems
… infinite dimensions. Then we design a deflected subgradient algorithm using our primal-dual framework and solve optimal control problems using the framework and the algorithm.
-
A subgradient algorithm for nonlinear integer programming and its parallel implementation
… is a general nonlinear function. The notion of subgradient for the objective function is introduced. A necessary and sufficient condition for the optimal solution is constructed. And a new algorithm, called the subgradient algorithm, is developed. The algorithm is an iterative procedure, …
-
Subgradient-based Decomposition Methods for Stochastic Mixed-integer Programs with Special Structures
… or stochastic program. Lagrangian relaxation and subgradient optimization techniques are used to facilitate negotiation between the nodal decisions in the system without any one entity gaining access to the private information from other nodes. A computational study on NDC using supply chain …
-
A primal-dual conjugate subgradient algorithm for large- scale/specially structured linear programming problems
… dissertation deals with a primal-dual conjugate subgradient-based algorithm for solving large-scale and/or specially structured linear programming problems. The proposed algorithm coordinates a Lagrangian dual function and a primal penalty function which satisfies a flexible set of specified …
-
Optimization of multistage systems with nondifferentiable objective functions.
… the objective function is accounted for by using subgradient information. The objective of the subproblems generated consists of successive piecewise linear approximations of the stagewise objective function and the value function. In the parallel algorithm, an incentive coordination method is …
-
Subdifferentials and their applications
… the Clarke generalized gradient, the limiting subgradient, and the proximal subgradient. In this thesis, we provide some conditions that guarantee the nonemptiness of the proximal subgradient, and the sum rule for proximal subgradients to hold. We have also found a class of functions f that can …
-
Sensitivity Analysis of Convex Relaxations for Nonsmooth Global Optimization
… Pang and Stewart are used to describe a correct subgradient for a nonsmooth dynamic system with two parameters. This sensitivity information can be computed using standard ODE solvers. Next, this thesis also uses the compass difference to obtain a subgradient for the Tsoukalas-Mitsos convex …
-
FIRST-ORDER METHODS FOR NONSMOOTH NONCONVEX FUNCTIONAL CONSTRAINED OPTIMIZATION WITH OR WITHOUT SLATER POINTS
… similar to those of "Quadratically regularized subgradient methods for weakly convex optimization with weakly convex constraints" by Ma et al. and "Stochastic first-order methods for convex and nonconvex functional constrained optimization" by Boob et al. (whose guarantees both assume …
-
A study of relatively weakly convex optimization models and their extensions
… algorithms, including the Bregman proximal subgradient method, Bregman stochastic proximal point method, Bregman stochastic proximal subgradient method, and Bregman stochastic prox-linear method. The convergence properties of these methods are established under mild assumptions. Extensions …
-
Special versus standard algorithms for large-scale harvest scheduling problems
… in the final iterations. A Primal-Dual Conjugate Subgradient Algorithm is also coded and tuned to solve general Model II problems. Results show that the computational effort is greatly affected by the number of side constraints. If the number of side constraints is restricted, the Primal-Dual …
-
Improving Lower Bound for Aircraft Routing Optimization. An Application of Lagrange Relaxation
… would lead to a stronger lower bound. Subgradient optimization with Polyak step size is used to solve the Lagrangian dual problem. Tests are performed, both with realistic implementations and with idealistic parameters, to investigate the potential of Lagrange relaxation, and solving …
-
Optimal control and nonlinear programming
… the form of a differential equation, satisfy a subgradient form of the Hamilton-Jacobi equation in which the Hamiltonian is measurable with respect to time. In the second part of this thesis, we first construct a concrete example to demonstrate conjugate duality theory in vector optimization as …
Page 1 of 7