11 problems
- 0 votes0 replies0 views
The midpoint-method conjecture on quadratic constraint violation
Midpoint constraint-violation conjecture. The constraint violation bound under the midpoint method scales as
- 0 votes0 replies0 views
Pinet's performance conjecture against DC3
Let denote the method studied in this paper, let denote the comparison method, and let denote the reported residual metric. The train…
- 0 votes0 replies0 views
Approximate Lagrange multiplier convergence for secant-function-augmented SOPICs
Approximate multiplier convergence conjecture. Under the direct-adjoining and secant-function-augmentation formulations, approaches as :
- 0 votes0 replies0 views
The Burrus conjecture on positivity-constrained confidence intervals
Consider the positivity-constrained Gaussian inverse problem … where is a forward linear operator, not necessarily of full column rank, and let…
- 0 votes0 replies1 view
Existence of analogous warpings for bounded polyhedra and convex sets
A decision set is a bounded polyhedron, also called a polytope, or a convex set, and a warping is a transformation used to formulate optimization over the interior of a constrained…
- 0 votes0 replies0 views
Improved affine-constrained query complexity conjecture for zeroth-order optimization
Consider the affine-constrained case in which , and let denote the nonsmooth term in the composite objective.…
- 0 votes0 replies0 views
The conjecture on progress in physics-constrained learning through non-convex optimization
Physics-constrained (informed) learning concerns using neural networks to learn solutions of partial differential equations while incorporating physical constraints. The non-convex…
- 0 votes0 replies0 views
Local stability conjecture for the active set in constrained perturbation problems
Consider the perturbed constrained optimization problem … where … Assume that at there is a unique optimal solution with a unique Lagrangian multiplier , let…
- 0 votes0 replies0 views
The difficulty of deterministic index-based algorithms for constrained multi-armed bandits
Let be the set of arms, let be the set of feasible arms, and let denote the set of deterministic algorithms for the constrained multi-armed bandit problem. An algor…
- 0 votes0 replies0 views
Constraint-specific explanation for the optimality gap in weakly coupled dynamic programs
Constraint-specific explanation conjecture. The difference between the results obtained for the paper's RMAB constraints and those obtained for the more general WCDP constraints is…
- 0 votes0 replies1 view
Frictional convergence conjecture for inertial game dynamics
Frictional convergence conjecture. Even a small amount of friction prohibits convergence to non-Nash profiles.