GitHub

Simplex-Method-R-package

The simplex method is a fast and efficient algorithm for solving linear programming. Inspired by the optimization method and the simplex method in Seminar 1, this project considers programming the ...
GitHub

tanvirhasan010/-Production-Cost-Minimization-of-a-Chips-Plant-by-Linear-Programming

This repository contains an optimization project that applies Linear Programming (LP) to minimize production costs for a potato chips manufacturing plant. The project addresses the complex challenge ...
IEEE

A Practical PAPR Minimization Algorithm for OFDM-Based JRC Systems via Linear Programming

Abstract: Orthogonal frequency-division multiplexing (OFDM)-based joint radar communication (JRC) systems have signal distortion when the transmit signal has a high peak-to-average power ratio (PAPR).
Scientific Research Publishing

Bolte, J., Sabach, S. and Teboulle, M. (2013) Proximal Alternating Linearized Minimization for Nonconvex and Nonsmooth Problems. Mathematical Programming, 146, 459-494.

ABSTRACT: The alternating direction method of multipliers (ADMM) and its symmetric version are efficient for minimizing two-block separable problems with linear constraints. However, both ADMM and ...
Scientific Research Publishing

Bolte, J., Sabach, S. and Teboulle, M. (2013) Proximal Alternating Linearized Minimization for Nonconvex and Non-Smooth Problems. Mathematical Programming, 146, 459-494.

ABSTRACT: In this paper, we investigate the convergence of the generalized Bregman alternating direction method of multipliers (ADMM) for solving nonconvex separable problems with linear constraints.