Separate the prediction horizon from the integer horizon: retain a long look ahead while relaxing distant on/off decisions to reduce computation.예측기간은 길게 유지하면서 가까운 미래의 on/off만 정수로 결정하고, 먼 미래에는 연속 완화를 허용해 계산 부담을 줄이는 아이디어.
Real-Time Nonlinear Mixed-Integer Model Predictive Control With Horizon-Tail RelaxationsReal-Time Nonlinear Mixed-Integer Model Predictive Control With Horizon-Tail Relaxations
What a conditional miss bound means, how certification costs grow, and how sampled scenario cuts support mixed-integer robust optimization.조건부 놓침 확률의 의미와 인증 검사량을 계산하고, 오류 예산 배분과 정수 설계별 Markov chain을 Benders cut에 연결합니다.
Soft Separation for Adaptive Robust OptimizationSoft Separation for Adaptive Robust Optimization
How scenario visit frequencies determine the optimization direction, why one-step Markov samples are biased, and which cumulative-error bound yields convergence.시나리오 방문 비율이 최적화 방향을 결정하는 이유를 살펴보고, 한 번의 Markov 전이로 생기는 편향과 수렴에 필요한 누적 오차 상계를 유도합니다.
A constraint can block all feasible motion while its gradient says nothing. Ramp limits and short multiplier proofs separate KKT necessity, convex sufficiency, and optimizer differentiability.제약은 실제 움직임을 막는데 gradient는 이를 표현하지 못할 수 있다. Ramp 예제와 짧은 승수 증명으로 KKT의 필요성, convex 문제의 충분성, 최적해의 미분 가능성을 구분한다.
A hard ramp example separates function-value gradients from action sensitivity, then derives forward and backward passes through the KKT equations of a quadratic program.Hard ramp 예제로 함수값의 미분과 action 민감도를 구분하고, QP의 KKT 조건을 통해 forward·backward pass를 유도한다.
OptNet: Differentiable Optimization as a Layer in Neural NetworksOptNet: Differentiable Optimization as a Layer in Neural Networks
A constrained optimizer cannot react to every prediction error. PEAR keeps the directions that can move the decision, making it most natural when system dynamics and constraints stay fixed while objective coefficients change across instances.제약 최적화기는 모든 예측 오차에 반응하지 않는다. PEAR는 의사결정을 움직일 수 있는 오차만 남기며, 시스템의 동역학과 제약은 같고 목적함수 계수만 달라지는 문제에 특히 잘 맞는다.
Decision-Focused Learning via Tangent-Space Projection of Prediction ErrorDecision-Focused Learning via Tangent-Space Projection of Prediction Error
A critical note on learning interpretable objective weights from expert production plans while preserving a known industrial MILP.알려진 산업 MILP를 유지하면서 전문가 생산계획으로부터 해석 가능한 목적함수 가중치를 학습하는 inverse optimization에 대한 비판적 정리.
Uncovering expert objectives in production planning via inverse optimization: An industrial case studyUncovering expert objectives in production planning via inverse optimization: An industrial case study
A note on ORACLE, which turns near-optimal energy-system exploration from point generation into an inner/outer approximation problem with a certified distance metric.near-optimal energy-system exploration을 단순한 point generation이 아니라 inner/outer approximation과 certified distance metric의 문제로 바꾸는 ORACLE에 대한 정리.
ORACLE: A rigorous metric and method to explore all near-optimal designs for energy systemsORACLE: A rigorous metric and method to explore all near-optimal designs for energy systems
A critical note on MadNCL, which combines Algorithm NCL, MadNLP, and GPU-friendly KKT reformulations to improve robustness on large-scale degenerate nonlinear programs.Algorithm NCL, MadNLP, GPU 친화적 KKT 재구성을 결합해 대규모 퇴화 비선형계획에서 강건성을 높이려는 MadNCL 논문에 대한 비판적 정리.
MADNCL: a GPU implementation of algorithm NCL for large-scale, degenerate nonlinear programsMADNCL: a GPU implementation of algorithm NCL for large-scale, degenerate nonlinear programs
A critical note on NLPOpt-Net, which learns a parametric NLP solution map with a neural warm start and an objective-aware differentiable projection layer.NLPOpt-Net을 신경망 warm start와 목적함수 인식 differentiable projection layer가 결합된 파라메트릭 NLP solution-map 학습법으로 정리한 비판적 노트.
NLPOpt-Net: A Learning Method for Nonlinear Optimization with Feasibility GuaranteesNLPOpt-Net: A Learning Method for Nonlinear Optimization with Feasibility Guarantees
A critical note on learned Lyapunov terminal costs for NMPC, focusing on Cholesky-structured positive-definite surrogates, horizon compression, and the unresolved role of approximation error.NMPC의 학습 기반 Lyapunov terminal cost를 비판적으로 읽는 글로, Cholesky 구조의 양의 정부호 surrogate, horizon compression, 그리고 approximation error의 미해결 역할을 중심으로 다룬다.
Learning Lyapunov terminal costs from data for complexity reduction in nonlinear model predictive controlLearning Lyapunov terminal costs from data for complexity reduction in nonlinear model predictive control