Poster Session and Competition

The poster session and competition will be held on Monday, July 25 from 6-8pm in the Rauch Business School atrium. Beverages and light snacks will be provided.

Below is the list of accepted poster presenters along with their poster titles. (See the bottom of this page for information about the submission process, which is now closed.)

Click here for full abstracts for the posters listed below.

  1. Bugra Can
    • Rutgers University, U.S.A.
    • “A Variance-Reduced Stochastic Accelerated Primal Dual Algorithm”
  2. Sebastian Colla
    • Université Catholique de Louvain, Belgium
    • “Optimization of Reactive Ink Formulation for Additive Manufacturing of Charged Membranes”
  3. Nicole Cortes
    • University of Notre Dame, U.S.A.
    • “Co-optimizing the Design and Operation strategy of solid oxide fuel cell-based hydrogen-electricity co-production systems”
  4. Niloofar Fadavi
    • Southern Methodist University, U.S.A.
    • “An active-set method for two stage stochastic quadratic programming”
  5. Jun-ya Gotoh
    • Chuo University, Japan
    • “Knot Selection of B-Spline Regression via Trimmed Regularizer”
  6. Fadi Hamad
    • University of Pittsburgh, U.S.A.
    • “A fully adaptive trust-region method”
  7. Yao Ji
    • Purdue University, U.S.A.
    • “Distributed Sparse Regression via Penalization”
  8. David Kiessling
    • KU Leuven, Belgium
    • “Efficient Numerical Algorithms for Time Optimal Control”
  9. J. Lyle Kim
    • Rice University, U.S.A.
    • “Convergence and Stability of the Stochastic Proximal Point Algorithm with Momentum”
  10. Clement Lezane
    • University of Twente, The Netherlands
    • “Algorithms for Stochastic Complementary Composite Minimization”
  11. Yongchun Li
    • Virginia Tech, U.S.A.
    • “D-optimal Data Fusion: Exact and Approximation Algorithms”
  12. Xinhong Liu
    • University of Notre Dame, U.S.A.
    • “Optimization of Reactive Ink Formulation for Additive Manufacturing of Charged Membranes”
  13. Si Yi Meng
    • Cornell University, U.S.A.
    • “Reusing function evaluations in derivative-free line search methods”
  14. Wenlong Mou
    • University of California, Berkeley, U.S.A.
    • “ROOT-SGD: Sharp Nonasymptotics and Asymptotic Efficiency in a Single Algorithm”
  15. Edward Duc Hien Nguyen
    • Rice University, U.S.A.
    • “Exact Diffusion with Local Steps”
  16. Vincent Roulet
    • University of Washington, U.S.A.
    • “Complexity Bounds of Iterative Linear Quadratic Optimization Algorithms for Discrete Time Nonlinear Control”
  17. Pouya Sampourmahani
    • Lehigh University, U.S.A.
    • “On the Semidefinite Representation of Second-order Conic Optimization Problems”
  18. Igor Sokolov
    • King Abdullah University of Science and Technology, Saudi Arabia
    • “EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedback”
  19. Trang Tran
    • Cornell University, U.S.A.
    • “Policy Optimization for Queueing Models”
  20. Jie Wang
    • Georgia Institute of Technology, U.S.A.
    • “Sinkhorn Distributionally Robust Optimization”
  21. Ke Wang
    • University of Notre Dame, U.S.A.
    • “Bayesian Optimization Considering Experimental and Physical Constraints – Case Study of Flash Sintering”
  22. Qi Wang
    • Lehigh University, U.S.A.
    • “Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization”
  23. Zeguan Wu
    • Lehigh University, U.S.A.
    • “Preconditioned Inexact Infeasible Quantum Interior Point Method for Linear Optimization”
  24. Miaolan Xie
    • Cornell University, U.S.A.
    • “High Probability Iteration and Sample Complexity Bounds for Stochastic Adaptive Step Search”
  25. Jinwen Yang
    • University of Chicago, U.S.A.
    • “Nearly Optimal Linear Convergence of Stochastic Primal-Dual Methods for Linear Programming”
  26. Chennan Zhou
    • Ohio State University, U.S.A.
    • “Effective scenarios in Two-stage DRO: properties and acceleration of decomposition algorithms”

Submissions for the poster session and competition are no longer being accepted. For reference, the text below is the original invitation for submissions.

  • Every poster presenter needs to be registered for the conference.
  • To display a poster, a presenter must submit an abstract here by April 29, 2022.
  • The abstract should not exceed the maximum allowed limit of 250 words and should include the following information:
    • Title of the poster
    • Name and affiliation of the presenter(s)
    • Co-authors names and affiliations
  • Due to space restrictions, a cap may be placed on the number of accepted posters.
  • Notification of acceptance or rejection of submissions will be sent by May 15 (tentative).
  • Posters should not exceed 36″ x 48″ in size.