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 11 of 11 for “"Smooth convex optimization"”.

  1. Convergence analysis of the approximate proximal splitting method for non-smooth convex optimization

    Consider a class of convex minimization problems for which the objective function is the sum of a smooth convex function and a non-smooth convex regularity term. This class of problems includes several popular applications such as compressive sensing and sparse group LASSO. In this thesis, we …

    umn Repository record for Convergence analysis of the approximate proximal splitting method for non-smooth convex optimization (opens in a new tab)

  2. Worst Case Datasets for Solving Binary Logistic Regression via Deterministic First-Order Methods

    … and Nesterov's construction of worst case convex quadratic programming problem instance. Our result is the first worst case dataset constructed against all first order methods for solving binary logistic regression, and a new worst case instance among smooth convex optimization problems.

    clemson Repository record for Worst Case Datasets for Solving Binary Logistic Regression via Deterministic First-Order Methods (opens in a new tab)

  3. Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods

    Non-smooth convex optimization problems occur in all fields of engineering. A common approach to solving this class of problems is proximal algorithms, or splitting methods. These first-order optimization algorithms are often simple, well suited to solve large-scale problems and have a low …

    lund Repository record for Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods (opens in a new tab) Download PDF for Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods (opens in a new tab)

  4. Structure and complexity in non-convex and non-smooth optimization

    Complexity theory drives much of modern optimization, allowing a fair comparison between competing numerical methods. The subject broadly seeks to both develop efficient algorithms and establish limitations on efficiencies of any algorithm for the problem class. Classical complexity theory based on …

    washington Repository record for Structure and complexity in non-convex and non-smooth optimization (opens in a new tab)

  5. On Large-Scale Optimization: Optimal Methods and Computer-Assisted Algorithm Design

    … we explore several branches of first-order optimization from the perspective of algorithm design and computer-assistance. In Part I, we consider the a priori design of algorithms, deriving new strategies or parameter choices to improve algorithm performance. We first analyze in Chapter 2 the …

    jhu Repository record for On Large-Scale Optimization: Optimal Methods and Computer-Assisted Algorithm Design (opens in a new tab)

  6. Information, complexity and structure in convex optimization

    … on the limits of performance of large-scale convex optimization algorithms. Classical theory of oracle complexity, first proposed by Nemirovski and Yudin in 1983, successfully established the worst-case behavior of methods based on local oracles (a generalization of first-order oracle for …

    gatech Repository record for Information, complexity and structure in convex optimization (opens in a new tab)

  7. Frank-Wolfe Methods for Optimization and Machine Learning

    … and projections on several sets commonly used in optimization, providing a rigorous support to the use of FW. We also propose two methods for projecting onto the lp-ball and the Birkhoff polytope respectively, and we analyze their complexity. Computational experiments for the l1-ball and the …

    gatech Repository record for Frank-Wolfe Methods for Optimization and Machine Learning (opens in a new tab)

  8. Decision-making for autonomous agents in adversarial or information-scarce settings

    … losses. Finally, we consider the problem of optimization under limited information since autonomous agents often perform optimization as a part of their operation. We develop optimization algorithms for smooth convex optimization using sub-zeroth-order oracles that provide less information …

    texas Repository record for Decision-making for autonomous agents in adversarial or information-scarce settings (opens in a new tab)

  9. Probabilistic Methods for Model Validation

    … refinement formulation leads to solving a non-smooth convex optimization problem. Examples are given to demonstrate how proximal operator splitting based computation enables numerically solving the same. This method is applied for nite-time feedback control of probability density functions, and …

    tamu Repository record for Probabilistic Methods for Model Validation (opens in a new tab)

  10. Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning

    … that impact our lives. Many such algorithms use optimization solvers as a subroutine, and there has been a revived interest in using robust approaches (like first-order optimization methods) that require low memory storage and iteration costs. In a wide range of applications, the optimization …

    gatech Repository record for Bridging Discrete and Continuous Methods for Faster Optimization and Machine Learning (opens in a new tab)