Results 21 to 30 of about 9,520,135 (306)
Localization and Approximations for Distributed Non-convex Optimization
Distributed optimization has many applications, in communication networks, sensor networks, signal processing, machine learning, and artificial intelligence. Methods for distributed convex optimization are widely investigated, while those for non-convex objectives are not well understood.
Hsu Kao, Vijay G. Subramanian
openaire +2 more sources
Non-convex mixed-integer nonlinear programming : a survey [PDF]
A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S, Letchford, Adam
core +2 more sources
Adaptive Strategies in Non-convex Optimization
An algorithm is said to be adaptive to a certain parameter (of the problem) if it does not need a priori knowledge of such a parameter but performs competitively to those that know it. This dissertation presents our work on adaptive algorithms in following scenarios: 1.
openaire +3 more sources
Bandwidth Maximization of Disturbance Observer Based on Experimental Frequency Response Data
A disturbance observer (DOB) has been widely employed in industrial field due to its simplicity and effectiveness in disturbance rejection. This paper focuses on systematic bandwidth-maximized DOB design by frequency response data-based convex ...
Xiaoke Wang +2 more
doaj +1 more source
On Mixed-Integer Random Convex Programs [PDF]
We consider a class of mixed-integer optimization problems subject to N randomly drawn convex constraints. We provide explicit bounds on the tails of the probability that the optimal solution found under these N constraints will become infeasible for the
D. Lyons +8 more
core +1 more source
Online non-convex optimization with imperfect feedback
We consider the problem of online learning with non-convex losses. In terms of feedback, we assume that the learner observes - or otherwise constructs - an inexact model for the loss function encountered at each stage, and we propose a mixed-strategy learning policy based on dual averaging.
Héliou, Amélie +3 more
openaire +4 more sources
Convex 1-D first-order total variation (TV) denoising is an effective method for eliminating signal noise, which can be defined as convex optimization consisting of a quadratic data fidelity term and a non-convex regularization term.
Cancan Yi, Yong Lv, Zhang Dang, Han Xiao
doaj +1 more source
ON OPTIMUM DESIGN OF FRAME STRUCTURES
Optimization of frame structures is formulated as a non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii) optimality ...
Marek Tyburec +3 more
doaj +1 more source
Optimality and Stability in Non-Convex Smooth Games
Convergence to a saddle point for convex-concave functions has been studied for decades, while recent years has seen a surge of interest in non-convex (zero-sum) smooth games, motivated by their recent wide applications. It remains an intriguing research challenge how local optimal points are defined and which algorithm can converge to such points.
Guojun Zhang +2 more
openaire +4 more sources
Communication and Computation Cooperation in Wireless Network for Mobile Edge Computing
The advantages of mobile edge computing (MEC) in lower energy consumption, improved bandwidth and reduced delay have attracted extensive studies. We consider a multiple smart wearable devices (SWDs) single smart mobile device (SMD) MEC system where the ...
Yang Li +4 more
doaj +1 more source

