Fetching the paper…
Reading the bibliography…
In this paper, we present a method for identifying infeasible, unbounded, and pathological conic programs based on Douglas-Rachford splitting, or equivalently ADMM.
Princeton University Press (1970)
Rockafellar, R.T.: Convex Analysis · 1970
Earlier work this paper cites.
Israel Journal of Mathematics 9
Pazy, A.: Asymptotic behavior of contractions in Hilbert space · 1971
Earlier work this paper cites.
Society for Industrial and Applied Mathematics (1974)
Rockafellar, R.T.: Conjugate Duality and Optimization · 1974
Earlier work this paper cites.
SIAM Journal on Control and Optimization 14
Rockafellar, R.T.: Monotone operators and the proximal point algorithm · 1976
Earlier work this paper cites.
Houston Journal of Mathematics 4
Baillon, J.B., Bruck, R.E., Reich, S.: On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces · 1978
Earlier work this paper cites.
SIAM Journal on Numerical Analysis 16
Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators · 1979
Earlier work this paper cites.
Journal of Mathematical Analysis and Applications 83
Borwein, J., Wolkowicz, H.: Regularizing the abstract convex program · 1981
Earlier work this paper cites.
Journal of the Australian Mathematical Society 30
Borwein, J.M., Wolkowicz, H.: Facial reduction for a cone-convex programming problem · 1981
Earlier work this paper cites.
Ph.D. thesis, MIT (1989)
Eckstein, J.: Splitting methods for monotone operators with applications to parallel optimization · 1989
Earlier work this paper cites.
In: W.W. Hager, D.W. Hearn, P.M. Pardalos (eds.) Large Scale Optimization, pp. 115–134. Springer (1994)
Eckstein, J., Fukushima, M.: Some reformulations and applications of the alternating direction method of multipliers · 1994
Earlier work this paper cites.
Econometric Institute, Erasmus University Rotterdam, The Netherlands, Technical Report 9719/A (1997)
Luo, Z.Q., Sturm, J.F., Zhang, S.: Duality results for conic convex programming · 1997
Earlier work this paper cites.
Optimization Methods and Software 14
Luo, Z.Q., Sturm, J.F., Zhang, S.: Conic convex programming and self-dual embedding · 2000
Cited alongside, same era.
Columbia University, Technical report (2000)
Pataki, G.: A simple derivation of a facial reduction algorithm and extended dual systems · 2000
Cited alongside, same era.
Journal of Approximation Theory 127
Bauschke, H.H., Combettes, P.L., Luke, D.: Finding best approximation pairs relative to two closed convex sets in Hilbert spaces · 2004
Cited alongside, same era.
IEEE Transactions on Automatic Control 54
Lofberg, J.: Pre- and post-processing sum-of-squares programs in practice · 2009
Cited alongside, same era.
CMS Books in Mathematics. Springer New York, New York, NY (2011)
Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces · 2011
Cited alongside, same era.
SIAM Journal on Control and Optimization 49
Svaiter, B.F.: On weak convergence of the Douglas–Rachford method · 2011
Permenter, F., Parrilo, P.: Partial facial reduction: Simplified, equivalent SDPs via approximations of the PSD cone · 2014
Later among the works it cites.
arXiv:1507.08065 [math] (2015)
Lourenço, B.F., Muramatsu, M., Tsuchiya, T.: Solving SDP completely with an interior point oracle · 2015
Later among the works it cites.
Optimization Online (2015)
Permenter, F., Friberg, H.A., Andersen, E.D.: Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach · 2015
Later among the works it cites.
Mathematics of Operations Research 41
Bauschke, H.H., Hare, W.L., Moursi, W.M.: On the range of the Douglas–Rachford operator · 2016
Later among the works it cites.
SIAM Journal on Optimization 26
Bauschke, H.H., Moursi, W.M.: The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Journal of Approximation Theory 164
Bauschke, H.H., Boţ, R.I., Hare, W.L., Moursi, W.M.: Attouch-Théra duality revisited: Paramonotonicity and operator splitting · 2012
Cited alongside, same era.
In: Mixed Integer Nonlinear Programming, pp. 447–481. Springer, New York, NY (2012)
Loera, J.A.D., Malkin, P.N., Parrilo, P.A.: Computation with polynomial equations and inequalities arising in combinatorial optimization · 2012
Cited alongside, same era.
In: M.F. Anjos, J.B. Lasserre (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, no. 166 in International Series in Operations Research & Management Science, pp. 339–375. Springer US (2012)
Yoshise, A.: Complementarity problems over symmetric cones: A survey of recent developments in several aspects · 2012
Cited alongside, same era.
Journal of Optimization Theory and Applications 158
Waki, H., Muramatsu, M.: Facial reduction algorithms for conic optimization problems · 2013
Cited alongside, same era.
SIAM Journal on Control and Optimization 52
Bauschke, H.H., Hare, W.L., Moursi, W.M.: Generalized solutions for the sum of two maximally monotone operators · 2014
Cited alongside, same era.
In: R. Glowinski, S. Osher, W. Yin (eds.) Splitting Methods in Communication, Imaging, Science and Engineering, Chapter 4. Springer (2016)
Davis, D., Yin, W.: Convergence rate analysis of several splitting schemes · 2016
Later among the works it cites.
In: Linear and Nonlinear Programming, no. 228 in International Series in Operations Research & Management Science, pp. 149–176. Springer International Publishing (2016)
Luenberger, D.G., Ye, Y.: Conic linear programming · 2016
Later among the works it cites.
In: R. Glowinski, S. Osher, W. Yin (eds.) Splitting Methods in Communication, Imaging, Science and Engineering, pp. 165–194. Springer (2016)
Yan, M., Yin, W.: Self equivalence of the alternating direction method of multipliers · 2016
Later among the works it cites.
Mathematical Programming 164
Bauschke, H.H., Moursi, W.M.: On the Douglas-Rachford algorithm · 2017
Closest in time.
Mathematical Programming pp. 1–46 (2017)
Liu, M., Pataki, G.: Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming · 2017
Closest in time.
Ph.D. thesis, University of British Columbia (2017)
Moursi, W.M.: The Douglas–Rachford operator in the possibly inconsistent case: Static properties and dynamic behaviour · 2017
Closest in time.