We present a fast Compressive Sensing algorithm for the reconstruction of binary signals {0, 1}-valued binary signals from its linear measurements. The proposed algorithm minimizes a non-convex penalty function that is given by a weighted sum of smoothed l0 norms, under the [0, 1] box-constraint. It is experimentally shown that the proposed algorithm is not only significantly faster than linear...

This paper studies a new multi-objective fuzzy optimization prob- lem. The objective function of this study has dierent levels. Therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. Since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. We study this problem and determine some special structures related...

Cooperative communication and orthogonal frequency division multiplexing (OFDM) technology are both promising candidates for next generation wireless communication systems. In this paper a Linear Programming (LP) based subcarrier allocation algorithm for cooperative multiuser OFDM system with grouped user is proposed. The proposed algorithm maximizes the data rate of all users over downlink und...

This letter investigates a downlink multiple input single output (MISO) system based on transmissive reconfigurable metasurface (RMS) transmitter. Specifically, transmitter design RMS equipped with feed antenna is first proposed. Then, in order to maximize the achievable sum-rate of system, beamforming and power allocation are jointly optimized. Since optimization variables coupled, this formul...

Problems in partial differential equations with inequality constraints can be used to describe a continuum analog to various optimal flow/cut problems. While general concepts from convex optimization (like duality) carry over into continuum problems, the application of ideas and algorithms from linear programming and network flow problems is challenging. The capacity constraints are non-linear ...

This paper presents a sequential optimization technique for the design of optimal trajectories while minimizing a cost index subject to system dynamics, path and actuation constraints. A novel coordinate transformation is introduced to cast the non-convex trajectory generation problem as a convex optimization problem. A sequential linear programming approach is discussed to solve the resulting ...

This paper proposes an explicit solution to the model predictive control of linear systems subject to non-convex polyhedral constraints. These constraints are modeled as the union of a finite number of convex polyhedra. The algorithm is based on calculating the explicit solution to a modified problem with linear constraints defined as the convex hull of the original ones and classifying its reg...

Convex multiobjective programming problems and multiplicative programming problems have important applications in areas such as finance, economics, bond portfolio optimization, engineering, and other fields. This paper presents a quite easy algorithm for generating a number of efficient outcome solutions for convex multiobjective programming problems. As an application, we propose an outer appr...

Non-deterministic programs can represent specifications, and non-determinism arises naturally in concurrent programming languages. In this dissertation, λ-calculi exhibiting erratic nondeterminism are studied in order to identify definitions and techniques that may be applicable to higher-order programming languages for specification or concurrency. The non-deterministic λ-calculi arise as frag...