Scott B. Lindstrom

According to our database, Scott B. Lindstrom authored at least 11 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Tight error bounds for log-determinant cones without constraint qualifications.

Ying Lin, Scott B. Lindstrom, Bruno F. Lourenço, Ting Kei Pong

CoRR, 2024

2023

Error bounds, facial residual functions and applications to the exponential cone.

Scott B. Lindstrom, Bruno F. Lourenço, Ting Kei Pong

Math. Program., 2023

2022

The projected polar proximal point algorithm converges globally.

Scott B. Lindstrom

J. Glob. Optim., 2022

Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions.

Scott B. Lindstrom

Comput. Optim. Appl., 2022

2021

The Generalized Bregman Distance.

Regina Sandra Burachik, Minh N. Dao, Scott B. Lindstrom

SIAM J. Optim., 2021

Generalized Bregman Envelopes and Proximity Operators.

Regina Sandra Burachik, Minh N. Dao, Scott B. Lindstrom

J. Optim. Theory Appl., 2021

Tight error bounds and facial residual functions for the p-cones and beyond.

Scott B. Lindstrom, Bruno F. Lourenço, Ting Kei Pong

CoRR, 2021

2019

Variational Analysis Down Under Open Problem Session.

Hoa T. Bui, Scott B. Lindstrom, Vera Roshchina

J. Optim. Theory Appl., 2019

The Douglas-Rachford algorithm for a hyperplane and a doubleton.

Heinz H. Bauschke, Minh N. Dao, Scott B. Lindstrom

J. Glob. Optim., 2019

2018

Regularizing with Bregman-Moreau Envelopes.

Heinz H. Bauschke, Minh N. Dao, Scott B. Lindstrom

SIAM J. Optim., 2018

2017

Continued Logarithms and Associated Continued Fractions.

Jonathan M. Borwein, Neil J. Calkin, Scott B. Lindstrom, Andrew Mattingly

Exp. Math., 2017