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 59 for “"Convex approximation"”.
-
Smooth convex approximation and its applications
In this thesis, we consider a smooth convex approximation to the sum of the $\kappa$ largest components. To make it applicable to a wide class of applications, the study is conducted on some minmax problems. Based on a special smoothing technique, we give an efficient scheme for nonsmooth convex …
-
Successive convex approximation: analysis and applications
… blocks by successively minimizing a sequence of approximations of f which are either locally tight upper bounds of f or strictly convex local approximations of f. Different block selection rules are considered such as cyclic (Gauss-Seidel), greedy (Gauss-Southwell), randomized, or even multiple …
-
Convex approximation methods for nonlinear model predictive control
… things in common: they all approximate some non-convex functions with<br>convex ones, and they are all useful in a real-time, embedded context. First, a convexification method for structured indefinite quadratic programming problems is presented. Such problems are found in sequential quadratic …
-
Joint resource allocation and routing in wireless networks via convex approximation techniques
… in the DSL literature, we use successive convex approximation strategies to approximate it, and come up with efficient centralized algorithms that provide approximate solutions to the BPPC problem. Our extensive simulation results prove that our proposed solutions deliver manifold …
-
On a strongly convex approximation of a stochastic optimal control problem for importance sampling of metastable diffusions
… Lösung des Optimierungsproblems eine Bestapproximation der optimalen Steuerung ist, die sich aus der Lösung der Hamilton-Jacobi-Bellman- Gleichung für die zugehörige Wertefunktion ergibt.
-
Computational optimization of networks of dynamical systems under uncertainties: application to the air transportation system
… the computational efficiency problem, a novel convex approximation based approach is proposed based on the numerical properties of the Bernstein polynomial. By effectively controlling the approximation error for both the function value and gradient, a first-order algorithm can be adopted to …
-
Hierarchical approaches to the hidden surface problem
… organization of the environment features. Convex polyhedra are used as elements of this hierarchy. Each polyhedron forms a convex approximation of the environment features which it contains. This hierarchy is used to provide efficient algorithms for solving the intersection, sorting and …
-
Computational Geometry in the Funk and Hilbert Metrics
… model of hyperbolic geometry to arbitrary convex bodies. It has applications in convex approximation, quantum information theory, machine learning, and real analysis. The Hilbert metric can be constructed as the average of the forward Funk and reverse Funk metrics, which are asymmetric …
-
Signal Timing Optimization to Improve Air Quality
… with the optimization problem. In addition, a convex approximation is proposed to approximate the emission calculation; accordingly, the optimization problem can be solved more efficiently using the interior point algorithm (IPA). The case study proves that the optimization problem with this …
-
Polynomial approximation in weighted spaces
One of the most important problems in Approximation Theory is to connect the rate with which a function can be approximated and the smoothness of this function. The goal is to show direct and inverse estimates in terms of some measure of smoothness. Typically, results are of the following type: ``a …
-
Non-convex Quadratically Constrained Quadratic Programming: Hidden Convexity, Scalable Approximation and Applications
… in polynomial-time. Such cases are said to be convex in a hidden way, and the task of identifying them remains an active area of research. Meanwhile, relatively few methods are known to be effective for general QCQP problems. The prevailing approach of Semidefinite Relaxation (SDR) is …
-
Optimal Control of a Commuter Train Considering Traction and Braking Delays
… spatial domain, which uses an already developed convex approximation to the optimization problem. The use of the convex approximation allows for robust and rapid computation of the optimal control solution. The non-equal traction-braking delays scenario is formulated in time domain, leading to a …
-
Fast algorithm for joint unicast and multicast beamforming in large-scale systems
… multicast subproblem, we apply the successive convex approximation (SCA) method to solve it iteratively. Each SCA subproblem is then reformulated to the ADMM form, providing the closed-form update for the multicast subproblem. Simulation results show that the proposed algorithm achieves a …
-
Exploring the Method of Moving Asymptotes for Various Optimization Applications
The development of sequential explicit, convex approximation schemes has allowed for expansion of the size of optimization problems that can now be achieved. These approximation schemes use information from the original optimization statement to generate a series of approximate subproblems allowing …
-
Optimal structure and efficient algorithm for max-min fair multi-group multicast beamforming
… by either direct method via successive convex approximation (SCA), or solving the QoS problem iteratively. For massive MIMO systems, we propose an efficient MMF multicast beamforming design based on the optimal solution structure. The semi-definite relaxation (SDR) method and an …
-
Applications of chance constrained optimization in operations management
… and upper bounds using Monte Carlo sampling and convex approximations are presented, as well as a branching heuristic for sample approximation lower bounds and an iterative algorithm for improved convex approximation upper bounds. The final application is in risk management for parimutuel horse …
-
Data-driven Nonparametric Joint Chance-Constrained Programming for Power Systems Scheduling
… or scenario-based methods like sample average approximation with limited performance with finite samples. The data-driven nonparametric JCC models presented in this work make no assumption on the type and shape of random variable PDFs. Line flow and reserve constraints are modeled as chance …
-
Parametric Frugal Sensing of Power Spectra for Moving Average Models
… data is formulated. This turns out being a non-convex quadratically constrained quadratic program (QCQP), which is NP--Hard in general. Approximate solutions can be obtained via semi-definite relaxation (SDR) followed by randomization; but this rarely produces a feasible solution for this …
-
Energy efficiency maximization for NOMA backscatter systems
… of the reader. The formulated problem is nonconvex. To obtain a suboptimal solution for this problem, we use alternating optimization technique and decompose the problem into two subproblems. The subproblems are solved by using fractional programming, Dinkelbach’s algorithm, and successive …
-
Energy-aware and RIS-assisted communications in UAV-based wireless networks
… programming, integer relaxation, and convex approximation, showing significant performance gains and enhancing UAV efficiency.
Page 1 of 3