REVIEW 1 cited by
Invex Optimization Revisited
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Given a non-convex optimization problem, we study conditions under which every Karush-Kuhn-Tucker (KKT) point is a global optimizer. This property is known as KT-invexity and allows to identify the subset of problems where an interior point method always converges to a global optimizer. In this work, we provide necessary conditions for KT-invexity in n-dimensions and show that these conditions become sufficient in the two-dimensional case. As an application of our results, we study the Optimal Power Flow problem, showing that under mild assumptions on the variable's bounds, our new necessary and sufficient conditions are met for problems with two degrees of freedom.
Forward citations
Cited by 1 Pith paper
-
Joint Power Control and User Association for NOMA-Based Full-Duplex Systems
Low-complexity successive-convexification algorithms for joint power control and user association in NOMA full-duplex systems reach within 1-2% of brute-force optimal spectral efficiency in simulation.
Discussion (0). Continue with ORCID to comment.