AI & ML
Extremal-Phase-Guided Sequential Convex Optimization: Model Order Reduction
arXiv cs.SY0 views
arXiv:2611.06850v1 Announce Type: new Abstract: Fixed-order frequency-weighted H-infinity approximation is a nonconvex problem, and local optimization methods can be sensitive to initialization. We present extremal-phase-guided sequential convex optimization (EPGSCO) for stable fixed-order rational approximation. We introduce a novel phase-guidance technique motivated by the all-pass structure underlying optimal Hankel-norm approximation, with a phase template fitted to the error-magnitude derivative at dominant peaks. We integrate this guidance with dominant-peak selection, focused frequency grids, and adaptive pole-residue and polynomial-coefficient updates to address stagnation and improve approximation accuracy. CD-player examples and benchmarks with known optimal errors evaluate the algorithm against established methods. Comparisons with classical sequential convex optimization (SCO) under shared settings for the common components assess the combined contribution of phase guidance and adaptive frequency refinement. Results demonstrate improved accuracy in most of the tested cases and attainment of the known optimum from four tested initializations for a constructed order-42 benchmark, with additional computation in some cases.
Source:https://arxiv.org/abs/2611.06850PreviousExcitability of High-Frequency Positive FeedbackNextHuman Mobility Sensing Using Wall-Reflected Beamformed Millimeter-Wave Communication Signals
Related posts
HYPIC: Position-Independent Caching for Hybrid-Attention LLM Serving
0arXiv cs.DC
TokenScale: Timely and Accurate Autoscaling for Disaggregated LLM Serving with Token Velocity
0arXiv cs.DC
Constant-Round Massively Parallel Algorithms for Approximate MSTs in Metric Spaces
0arXiv cs.DC
CHARM+: Cross-Hardware Attention with Re-Merge Multistream Mechanism
0arXiv cs.DC
RESHPart: Feedback-Reshaped Spectral Embedding for Hypergraph Partitioning
0arXiv cs.DC
A Feasibility Condition for Confidence-Gated Tiered LLM Inference
0arXiv cs.DC