2 problems
- 0 votes0 replies0 views
Quadratic-subproblem conjecture for SQP methods in minimax optimization
Consider a minimax quadratic optimization problem with outer variable , inner variable , objective … subject to coupled constraints…
- 0 votes0 replies0 views
Global convergence of decentralized SQP with inexact subproblem solutions
Global convergence conjecture. Global convergence results with inexact subproblem solutions may be derived using merit functions.