Works (4)
Updated: July 5th, 2023 15:38
2019 journal article
A gradient descent based algorithm for ℓp minimization
European Journal of Operational Research, 283(1), 47–56.
author keywords: Global optimization; Nonsmooth optimization; Nonconvex optimization; Gradient descent algorithm; KKT condition
TL;DR:
A gradient-descent-based algorithm is proposed to find solutions satisfying the scaled KKT condition without invoking the nondifferentiability issue and is capable of achieving much better sparse recovery in reasonable computational time compared to state-of-the-art interior-point based algorithms.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: February 17, 2020
2019 journal article
Bidding Decisions with Nonequilibrium Strategic Thinking in Reverse Auctions
Group Decision and Negotiation, 28(4), 757–786.
author keywords: Reverse auction; Bounded rationality; Nonequilibrium strategic thinking; Level-k model
UN Sustainable Development Goal Categories
10. Reduced Inequalities
(Web of Science)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 5, 2019
2016 journal article
An enhanced logarithmic method for signomial programming with discrete variables
European Journal of Operational Research, 255(3), 922–934.
author keywords: Signomial programming; Mixed 0-1 linear programming; Linearization technique
TL;DR:
An enhanced logarithmic method is proposed to reformulate the SPD problem as a mixed 0-1 linear program (MILP) with a minimum number of binary variables and inequality constraints to support its superior performance to other state-of-the-art linearization methods.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018
2016 journal article
On linear conic relaxation of discrete quadratic programs
Optimization Methods and Software, 31(4), 737–754.
author keywords: discrete quadratic program; linear conic relaxation; RLT method
TL;DR:
A special reformulation-linearization technique based linear conic relaxation is proposed for discrete quadratic programming (DQP) and it is shown that the proposed relaxation is tighter than the traditional positive semidefinite programming relaxation.
(via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, Crossref
Added: August 6, 2018