REVIEW 2 cited by
Tutorials on Advanced Optimization Methods
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
This material provides thorough tutorials on some optimization techniques frequently used in various engineering disciplines, including convex optimization, linearization techniques and mixed-integer linear programming, robust optimization, and equilibrium/game problems. It discusses how to reformulate a difficult (non-convex, multi-agent, min-max) problem to a solver-compatible form (semidefinite program, mixed-integer linear program) via convexification, linearization, and decomposition, so the original problem can be reliably solved by commercial/open-source software. Fundamental algorithms are not the main focus. This material is a good reference for self-learners who have basic knowledge in linear algebra and linear programming. It is one of the main references for an optimization course taught at Tsinghua University.
Forward citations
Cited by 2 Pith papers
-
FICA: Faster Inner Convex Approximation of Chance Constrained Grid Dispatch with Decision-Coupled Uncertainty
For Wasserstein joint chance constraints with AGC-coupled uncertainty, FICA provably reproduces the CVaR feasible region while pruning most sample constraints, yielding large speedups.
-
Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
A stochastic halfspace projection method with flexible linearization point achieves O(1/sqrt(k)) optimality and feasibility violation for convex smooth objectives with nonsmooth constraints, and O(1/k) under strong convexity.
Discussion (0). Continue with ORCID to comment.