Credible autocoding of convex optimization algorithms

@article{Wang2014CredibleAO,
  title={Credible autocoding of convex optimization algorithms},
  author={T. Wang and Romain Jobredeaux and M. Pantel and P. Garoche and E. Feron and D. Henrion},
  journal={Optimization and Engineering},
  year={2014},
  volume={17},
  pages={781-812}
}
  • T. Wang, Romain Jobredeaux, +3 authors D. Henrion
  • Published 2014
  • Computer Science
  • Optimization and Engineering
  • The efficiency of modern optimization methods, coupled with increasing computational resources, has led to the possibility of real-time optimization algorithms acting in safety-critical roles. There is a considerable body of mathematical proofs on on-line optimization algorithms which can be leveraged to assist in the development and verification of their implementation. In this paper, we demonstrate how theoretical proofs of real-time optimization algorithms can be used to describe functional… CONTINUE READING
    9 Citations
    Credible Autocoding of The Ellipsoid Algorithm Solving Second-Order Cone Programs
    Formal verification of an interior point algorithm instanciation
    Formal Verification for Embedded Implementation of Convex Optimization Algorithms
    • 2
    • PDF
    Verification and Validation of Convex Optimization Algorithms for Model Predictive Control
    Credible autocoding of control software
    • 5

    References

    SHOWING 1-10 OF 56 REFERENCES
    Certification aspects of the fast gradient method for solving the dual of parametric convex programs
    • 39
    • PDF
    Chaff: engineering an efficient SAT solver
    • 3,522
    • PDF
    Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
    • F. Alizadeh
    • Mathematics, Computer Science
    • SIAM J. Optim.
    • 1995
    • 943
    • PDF
    Evaluation of optimization methods for control allocation
    • 536
    • PDF
    Interior-point polynomial algorithms in convex programming
    • 3,110
    • PDF
    Primal-Dual Path-Following Algorithms for Semidefinite Programming
    • R. Monteiro
    • Mathematics, Computer Science
    • SIAM J. Optim.
    • 1997
    • 349
    • PDF
    Primal-Dual Interior-Point Methods for Self-Scaled Cones
    • 527
    • PDF
    Requirements and hard computational bounds for real-time optimization in safety-critical control systems
    • L.K. McGovern, E. Feron
    • Computer Science
    • Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171)
    • 1998
    • 15