Pith.

Optimization and Control · arXiv:2611.17026 v1 · submitted 12 Nov 2026 · 53 references

Accelerated Transformed Primal Dual Methods for Smooth Convex Optimization Problems with Affine Equality Constraints

Long Chen, Jingrong Wei

The paper says

“Accelerated transformed primal–dual (ATPD) methods are proposed for smooth convex optimization problems with affine equality constraints. The methods combine primal–dual dynamics with a transformation designed to accelerate convergence.”

more of the abstract

In the strongly convex case, ATPD achieves an accelerated linear convergence rate and matches the known lower bounds on first-order oracle complexity in terms of gradient evaluations and matrix–vector products. The analysis distinguishes these two types of computational work when assessing the complexity of the method. For general convex objectives, a homotopy perturbation strategy is introduced, and an accelerated sublinear rate for the modified Lyapunov energy is proved under a uniform boundedness condition on the primal iterates at all homotopy stages. The acceleration mechanism is based on an exponentially stable ATPD flow and a modified discrete Lyapunov function. This continuous-time perspective guides the construction and analysis of the discrete methods. Numerical experiments on policy evaluation and constrained signal reconstruction problems support the theory and illustrate the efficiency of the proposed methods.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up, with conditions. Strongly convex ATPD results are solid and match lower bounds; the general convex O(1/N2) rate is conditional on an unproven uniform boundedness assumption that the authors acknowledge but do not resolve. This line is wrong

1 major objection · 4 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 53 references say.

The paper says, at Theorem 5.1 and Remark 5.1

The review did not quote this passage.

A classifier read this sentence of the paper as acknowledging the concern (probability 0.86):

“The homotopy theorem below separately assumes a uniform bound over all stages; the fixed-parameter result does not by itself estab- lish that bound.”

Pith says: Objection 1 of 1 · major

The O(1/N^2) rate for general convex objectives in Theorem 5.1 depends on the uniform boundedness assumption that all primal iterates at every homotopy stage satisfy ||x - x*||^2 <= R^2. The paper acknowledges in Remark 5.1 that the fixed-parameter result (Proposition 5.1) does not establish this bound, and the homotopy theorem separately assumes it.

more of objection 1

No argument is given that the homotopy halving of epsilon preserves the bound. Without this condition, the perturbed decay estimate (Lemma 5.3) cannot be applied, and the claimed accelerated sublinear rate has no proof. This is a load-bearing gap for the convex part of the paper and should be addressed, either by proving the boundedness condition under reasonable assumptions or by restating the convex claim as conditional.

4 minor objections

The paper says, at Algorithm 2, line 2

Pith says: minor objection 1 of 4

The step-size bound is written as '1-delta 1+delta', which is ambiguous; it should be written as (1-delta)/(1+delta) for clarity.

The paper says, at Section 6.2, Figure 1

Pith says: minor objection 2 of 4

Figure 1 is referenced but has no caption or detailed description in the text; a brief description of what is plotted should be included.

show 2 more

The paper says, at Section 6.3.2, Figure 3

Pith says: minor objection 3 of 4

The comparison includes OptAlg, ALALM, and APAPC, but the parameters used for these methods are not specified; this should be clarified for reproducibility.

The paper says, at Remark 4.1

Pith says: minor objection 4 of 4

The paper states that residual-based stopping does not imply the spectral bound (30); it would be helpful to clarify whether the numerical experiments use a fixed linear solver or a residual-based stopping criterion, and whether the theoretical guarantees apply in the latter case.

What would settle it

Construct a convex L-smooth f (e.g., f(x)=0 on a bounded set and quadratic outside) and a constraint Bx=b such that the homotopy ATPD (Algorithm 3) generates a primal iterate with ∥x−x⋆∥² exceeding the initial bound R². If such an example exists, the uniform boundedness assumption fails and the O(1/N²) claim is unsupported. Alternatively, prove that the homotopy dynamics enforce the bound automatically; the paper currently does not provide such a proof.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up, with conditions confidence moderate
  2. Skeptic agrees 5 s · 28,165 tokens read, 540 written
  3. Editor wrote the verdict above 6 s · 29,018 tokens read, 566 written
  4. Referee major revision: 1 major objection, 4 minor 35 s · 33,253 tokens read, 857 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

The strongly convex part of this paper is well done. The ATPD algorithm is a genuine new construction—adding an auxiliary variable y to the transformed primal-dual flow, using AOR-based implicit-explicit discretization, and proving decay of a modified Lyapunov function with separate gradient and matrix-vector complexity counts. The analysis is careful, the Lyapunov identities check out, and the step-size conditions in Theorem 4.2 and Corollary 4.1 are explicit. The strongly convex results match the lower bounds from Salim et al. [45], which is the right benchmark. Credit where due: this is a clean piece of work for the µ>0 case.

The soft spot is the general convex homotopy result (Theorem 5.1). The paper states the uniform boundedness assumption ∥x−x⋆∥² ≤ R² for all primal iterates at every homotopy stage, and Remark 5.1 explicitly says the fixed-parameter result (Proposition 5.1) does not establish this bound. The induction in the proof of Theorem 5.1 simply assumes it holds. No argument is given that the homotopy halving of ε preserves the bound. So the O(1/N²) rate for general convex objectives is conditional on an unverified assumption. The authors are honest about this—they flag it themselves—but it means the central claim for the convex case is not yet a theorem. The strongly convex results are unaffected.

Minor issues: the numerical experiments run with parameters outside the theoretical guarantees (e.g., ATPD-0 with θ=1, which violates the strict inequality in Lemma 5.2). The authors disclose this, but it weakens the experimental support for the theory. No code is shipped, so the numerical claims cannot be independently reproduced from the preprint.

Who this is for: researchers working on first-order methods for constrained convex optimization, especially those interested in oracle complexity separation. The strongly convex part is a solid contribution. The convex part is a conditional result that needs further work.

Recommendation: I would send this to peer review. The strongly convex analysis is worth refereeing, and the convex part can be addressed in revision. The paper is serious and the authors are transparent about limitations.

The strongest objection

The central claim for general convex objectives—accelerated O(1/N^2) decay of the modified Lyapunov energy—rests on the uniform boundedness condition ∥x−x⋆∥² ≤ R² for all primal iterates at every homotopy stage (Theorem 5.1, line [b224]). The paper itself states in Remark 5.1 (line [b216]) that the fixed-parameter result (Proposition 5.1) does not establish this bound, and that the homotopy theorem separately assumes it. No argument is given that the homotopy halving of ε preserves the bound; the induction in the proof of Theorem 5.1 simply assumes it holds. Without this condition, the perturbed decay estimate (Lemma 5.3) cannot be applied, and the O(1/N²) rate has no proof. The strongly convex results (Theorem 4.2, Corollary 4.1) do not require this assumption and are unaffected.

The reader's weakest_assumption correctly identifies the uniform boundedness condition in Theorem 5.1 as the key unresolved issue. The paper's own Remark 5.1 acknowledges that the fixed-parameter result does not establish this bound. My stress-test confirms that this is the single most load-bearing concern: the O(1/N²) convex rate is conditional on an unverified assumption. The strongly convex results are not affected. The reader's verdict of CONDITIONAL is appropriate; no change is needed. The concrete test I propose would settle whether the assumption can be violated or whether a proof is missing.

The referee's report

If the strongly convex results are correct, ATPD provides an optimal first-order method for constrained smooth strongly convex problems with separate complexity bounds for gradient evaluations and matrix-vector products, which is a significant contribution. The continuous-time Lyapunov analysis is elegant and guides the discrete algorithm. The convex extension is potentially important but currently conditional on an unproven boundedness assumption.

Pith's reading of the paper (a machine's summary, not the authors')

This paper introduces Accelerated Transformed Primal–Dual (ATPD) methods that achieve the known lower bounds on first-order oracle complexity for smooth convex optimization with affine equality constraints. For strongly convex objectives, ATPD converges linearly with a contraction factor depending on the square root of the condition number, using one gradient evaluation and two matrix–vector products per iteration. For general convex objectives, a homotopy strategy yields an accelerated sublinear rate under a uniform boundedness condition. The method avoids projections and exact subproblem solves, making it practical for large-scale problems where the cost of matrix–vector products dominates.

What carries the argument. The accelerated transformed primal–dual flow (ATPD flow) combines an auxiliary variable splitting with a linear transformation that restores strong monotonicity of the saddle operator. The flow is discretized using accelerated overrelaxation, leading to Algorithm 2. The modified discrete Lyapunov function E_α^M incorporates a cross-term that enables the accelerated convergence analysis via a strong Lyapunov property.

Core claim. ATPD methods achieve optimal first-order oracle complexity for smooth convex optimization with affine equality constraints. For strongly convex objectives, the method attains a linear convergence rate matching the lower bounds derived by Salim et al. (2022). The acceleration mechanism is based on an exponentially stable continuous-time flow and a modified discrete Lyapunov function. The analysis separates the costs of gradient evaluations and matrix–vector products, showing that ATPD uses O(√κ(f) log(1/ε)) gradient evaluations and O(√κ(f)κ(BBᵀ) log(1/ε)) matrix–vector products to reach ε-accuracy.

The premise it rests on. For general convex objectives, the homotopy method's accelerated sublinear rate depends on the assumption that all primal iterates at every homotopy stage stay within a fixed ball of known radius around the solution.

If the paper is right (Pith's inferences, not the authors')

If ATPD is correct, it provides the first method achieving the separate oracle complexity bounds for gradient evaluations and matrix–vector products without projections or exact subproblem solves.

The method directly applies to problems in PDE-constrained optimization, image processing, distributed optimization, and machine learning where affine constraints appear.

The homotopy extension offers a practical way to handle unknown strong convexity parameters while maintaining accelerated rates under a boundedness condition.

The analysis framework connecting continuous-time flows to discrete algorithms may guide the design of accelerated methods for other structured optimization problems.

The uniform boundedness assumption in Theorem 5.1 is not verified by the paper for the homotopy method; a proof that the bound holds under the algorithm's dynamics would complete the convex case theory.

The method's reliance on a fixed linear inner solver satisfying (30) may be restrictive; practical implementations using CG or other nonlinear solvers are not covered by the convergence theory.

The extension to nonsmooth objectives, mentioned as future work, would significantly broaden applicability to problems like Lasso or total variation denoising, but would require new techniques to handle nondifferentiability.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

Accelerated transformed primal–dual (ATPD) methods are proposed for smooth convex optimization problems with affine equality constraints. The methods combine primal–dual dynamics with a transformation designed to accelerate convergence. In the strongly convex case, ATPD achieves an accelerated linear convergence rate and matches the known lower bounds on first-order oracle complexity in terms of gradient evaluations and matrix–vector products. The analysis distinguishes these two types of computational work when assessing the complexity of the method. For general convex objectives, a homotopy perturbation strategy is introduced, and an accelerated sublinear rate for the modified Lyapunov energy is proved under a uniform boundedness condition on the primal iterates at all homotopy stages. The acceleration mechanism is based on an exponentially stable ATPD flow and a modified discrete Lyapunov function. This continuous-time perspective guides the construction and analysis of the discrete methods. Numerical experiments on policy evaluation and constrained signal reconstruction problems support the theory and illustrate the efficiency of the proposed methods.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-13

The authors' main claim, as the classifier picked it out 0.78

“In the strongly convex case, ATPD achieves an accelerated linear convergence rate and matches the known lower bounds on first-order oracle complexity in terms of gradient evaluations and matrix--vector products.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.68 · human participants 0.02 · controlled comparison 0.05 · randomized assignment 0.01 · states quantitative result 0.49 · compares with prior results 0.64 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Accelerated transformed primal--dual (ATPD) methods are proposed for smooth convex optimization problems with affine equality constraints. contribution 0.99 0.92 0.35 asserted 1.00
The methods combine primal--dual dynamics with a transformation designed to accelerate convergence. method 0.87 0.80 0.10 asserted 1.00
In the strongly convex case, ATPD achieves an accelerated linear convergence rate and matches the known lower bounds on first-order oracle complexity in terms of gradient evaluations and matrix--vector products. result 1.00 0.92 0.47 asserted 1.00
The analysis distinguishes these two types of computational work when assessing the complexity of the method. method 0.59 0.81 0.04 asserted 0.98
For general convex objectives, a homotopy perturbation strategy is introduced, and an accelerated sublinear rate for the modified Lyapunov energy is proved under a uniform boundedness condition on the primal iterates at all homotopy stages. contribution 0.70 0.94 0.16 asserted 1.00
The acceleration mechanism is based on an exponentially stable ATPD flow and a modified discrete Lyapunov function. method 0.96 0.82 0.08 asserted 1.00
This continuous-time perspective guides the construction and analysis of the discrete methods. method 0.92 0.73 0.04 asserted 1.00
Numerical experiments on policy evaluation and constrained signal reconstruction problems support the theory and illustrate the efficiency of the proposed methods. result 0.73 0.95 0.14 asserted 0.99

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from proof or derivation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 6,151 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (4)
Figure 1 of the paper
Figure 1. TPD and ATPD algo￾rithms for solving the policy evaluation problem
Figure 2 of the paper
Figure 2. Numerical results for the ATPD method solving the compressed sensing prob
Figure 3 of the paper
Figure 3. Numerical results for variants of the ATPD method to solve the compressed
Figure 4 of the paper
Figure 4. Numerical results for Algorithm 3 (ATPD-0) on benchmark signal reconstruc￾tion problems: (a) Sparco 9 (low resolution, size 128); (b) Sparco 10 (high resolution, size 1024); (c) Sparco 11 with κ(f) = 108 . In each row, the panels show the error curve (left), original signal (middle), and reconstructed signal (right). For Sparco 11, the smoothed ℓ1 objective f is less accurate at recovering the exact solution. When κ(f) = 103 , the solution error stays around O(1) even when the constraint is satisfied. To improve the recovery, we increase the condition number to κ(f) = 108 for a…

Figures are the authors', reproduced from the paper.

References (53)
  1. [45] Salim, A., Condat, L., Kovalev, D., Richtarik, P.: An optimal algorithm for strongly convex minimiza- tion under affine constraints. In: G. Camps-Valls, F.J.R. Ruiz, I. Valera (eds.) Proceedings of The 25th International Conference on Artificial Intelligence and Statistics, Pr... on Pith
  2. [1] Alacaoglu, A., Fercoq, O., Cevher, V .: On the convergence of stochastic primal-dual hybrid gradi- ent. SIAM Journal on Optimization32(2), 1288–1318 (2022).https://doi.org/10.1137/ 19M1296252 on Pith
  3. [2] Arrow, K.J., Hurwicz, L., Uzawa, H. (eds.): Studies in Linear and Non-Linear Programming, Stanford Mathematical Studies in the Social Sciences, vol. 2. Stanford University Press, Stanford, CA (1958) on Pith
  4. [3] Bacuta, C.: Schur complements on Hilbert spaces and saddle point systems. Journal of Compu- tational and Applied Mathematics225(2), 581–593 (2009).https://doi.org/10.1016/j. cam.2008.08.025 on Pithdoi:10.1016/j
  5. [4] Benzi, M., Golub, G.H., Liesen, J.: Numerical solution of saddle point problems. Acta Numerica14, 1–137 (2005).https://doi.org/10.1017/S0962492904000212 on Pithdoi:10.1017/s0962492904000212
  6. [5] van den Berg, E., Friedlander, M.P., Hennenfent, G., Herrmann, F.J., Saab, R., Yılmaz, ¨O.: Algorithm 890: Sparco: A testing framework for sparse reconstruction. ACM Transactions on Mathematical Software35(4), 29:1–29:16 (2009).https://doi.org/10.1145/1462173.1462178 on Pithdoi:10.1145/1462173.1462178
  7. [6] Borodich, E., Kormakov, G., Kovalev, D., Beznosikov, A., Gasnikov, A.: Near-optimal algorithm with complexity separation for strongly convex-strongly concave composite saddle point problems. Opti- mization Methods and Software, pp. 1–24 (2025).https://doi.org/10.1080/10556788.... on Pithdoi:10.1080/10556788
  8. [7] Bot ¸, R.I., Csetnek, E.R., Nguyen, D.K.: Fast augmented Lagrangian method in the convex regime with convergence guarantees for the iterates. Mathematical Programming200(1), 147–197 (2023). https://doi.org/10.1007/s10107-022-01879-4 on Pithdoi:10.1007/s10107-022-01879-4
  9. [8] Botsaris, C.A.: A class of differential descent methods for constrained optimization. Journal of Mathematical Analysis and Applications79(1), 96–112 (1981).https://doi.org/10.1016/ 0022-247X(81)90012-3 on Pith
  10. [9] Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning3(1), 1–122 (2011).https://doi.org/10.1561/2200000016 on Pithdoi:10.1561/2200000016
  11. [10] Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of Mathematical Imaging and Vision40(1), 120–145 (2011).https://doi. org/10.1007/s10851-010-0251-1 on Pithdoi:10.1007/s10851-010-0251-1
  12. [11] Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numerica25, 161–319 (2016).https://doi.org/10.1017/S096249291600009X on Pithdoi:10.1017/s096249291600009x
  13. [12] Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Breg- man functions. SIAM Journal on Optimization3(3), 538–543 (1993).https://doi.org/10. 1137/0803026 on Pith
  14. [13] Chen, L.: iFEM: an innovative finite element method package in MATLAB. Preprint (2008). URL https://www.math.uci.edu/˜chenlong/Papers/iFEMpaper.pdf on Pith
  15. [14] Chen, L., Wei, J.: Transformed primal–dual methods for nonlinear saddle point systems. Jour- nal of Numerical Mathematics31(4), 281–311 (2023).https://doi.org/10.1515/ jnma-2022-0056 on Pith
  16. [15] Chen, X.: Global and superlinear convergence of inexact Uzawa methods for saddle point problems with nondifferentiable mappings. SIAM Journal on Numerical Analysis35(3), 1130–1148 (1998). https://doi.org/10.1137/S0036142995295789 on Pithdoi:10.1137/s0036142995295789
  17. [16] Cheng, X.L.: On the nonlinear inexact Uzawa algorithm for saddle-point problems. SIAM Journal on Numerical Analysis37(6), 1930–1934 (2000).https://doi.org/10.1137/ S0036142998349266 on Pith
  18. [17] Dann, C., Neumann, G., Peters, J.: Policy evaluation with temporal differences: A survey and com- parison. Journal of Machine Learning Research15(24), 809–883 (2014) on Pith
  19. [18] Devolder, O., Glineur, F., Nesterov, Y .: First-order methods of smooth convex optimization with inex- act oracle. Mathematical Programming146(1–2), 37–75 (2014).https://doi.org/10.1007/ s10107-013-0677-5 on Pith
  20. [19] Du, S.S., Chen, J., Li, L., Xiao, L., Zhou, D.: Stochastic variance reduction methods for policy eval- uation. In: D. Precup, Y .W. Teh (eds.) Proceedings of the 34th International Conference on Machine Learning, vol. 70, pp. 1049–1058. PMLR (2017) on Pith
show 33 more
  1. [20] Du, S.S., Hu, W.: Linear convergence of the primal-dual gradient method for convex-concave sad- dle point problems without strong convexity. In: K. Chaudhuri, M. Sugiyama (eds.) Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics... on Pith
  2. [21] Dvinskikh, D., Gasnikov, A.: Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems. Journal of Inverse and Ill-Posed Problems29(3), 385–405 (2021).https://doi.org/10.1515/jiip-2020-0068 on Pithdoi:10.1515/jiip-2020-0068
  3. [22] Goldstein, T., O’Donoghue, B., Setzer, S., Baraniuk, R.: Fast alternating direction optimization meth- ods. SIAM Journal on Imaging Sciences7(3), 1588–1623 (2014).https://doi.org/10. 1137/120896219 on Pith
  4. [23] Guo, R., Zou, J.: Inexact projected preconditioned gradient methods with variable metrics: Gen- eral convergence theory via Lyapunov approach. arXiv preprint arXiv:2506.03671v1 (2025). URL https://arxiv.org/abs/2506.03671v1 on PithPith's reviewarXiv
  5. [24] He, B., Yuan, X.M.: On the acceleration of augmented Lagrangian method for linearly constrained optimization. Optimization Online (2010). URLhttps://optimization-online.org/ 2010/10/2760/ on Pith
  6. [25] He, X.: Accelerated primal-dual methods with adaptive parameters for composite convex optimization with linear constraints. Applied Numerical Mathematics203, 129–143 (2024).https://doi. org/10.1016/j.apnum.2024.05.021 on Pithdoi:10.1016/j.apnum.2024.05.021
  7. [26] He, X., He, D., Fang, Y .P.: Accelerated primal–dual methods for strongly convex objective functions in continuous and discrete time. Automatica183, 112579 (2026).https://doi.org/10.1016/ j.automatica.2025.112579. Accelerated Transformed Primal Dual Methods 33 on Pith
  8. [27] He, X., Hu, R., Fang, Y .P.: Fast primal–dual algorithm via dynamical system for a linearly constrained convex optimization problem. Automatica146, 110547 (2022).https://doi.org/10.1016/ j.automatica.2022.110547 on Pith
  9. [28] He, X., Hu, R., Fang, Y .P.: Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems. Numerical Algorithms90(4), 1669–1690 (2022).https://doi. org/10.1007/s11075-021-01246-y on Pithdoi:10.1007/s11075-021-01246-y
  10. [29] Hestenes, M.R.: Multiplier and gradient methods. Journal of Optimization Theory and Applications 4(5), 303–320 (1969).https://doi.org/10.1007/BF00927673 on Pithdoi:10.1007/bf00927673
  11. [30] Hu, Q., Zou, J.: Two new variants of nonlinear inexact Uzawa algorithms for saddle-point problems. Numerische Mathematik93(2), 333–359 (2002).https://doi.org/10.1007/ s002110100386 on Pith
  12. [31] Huang, B., Ma, S., Goldfarb, D.: Accelerated linearized Bregman method. Journal of Scientific Com- puting54(2–3), 428–453 (2013).https://doi.org/10.1007/s10915-012-9592-9 on Pithdoi:10.1007/s10915-012-9592-9
  13. [32] Jin, Y ., Sidford, A., Tian, K.: Sharper rates for separable minimax and finite sum optimization via primal-dual extragradient methods. In: P.L. Loh, M. Raginsky (eds.) Proceedings of Thirty Fifth Conference on Learning Theory, Proceedings of Machine Learning Research, vol. 17... on Pith
  14. [33] Kia, S.S., Wei, J., Chen, L.: Distributed optimal resource allocation using transformed primal-dual method. In: A. Fekih (ed.) 2023 American Control Conference (ACC), pp. 198–203. IEEE (2023). https://doi.org/10.23919/ACC55779.2023.10156601 on Pithdoi:10.23919/acc55779.2023.10156601
  15. [34] Kovalev, D., Gasnikov, A., Richtarik, P.: Accelerated primal-dual gradient method for smooth and convex-concave saddle-point problems with bilinear coupling. In: S. Koyejo, S. Mohamed, A. Agar- wal, D. Belgrave, K. Cho, A. Oh (eds.) Advances in Neural Information Processing Sy... on Pith
  16. [35] Levitin, E.S., Polyak, B.T.: Constrained minimization methods. USSR Computational Mathematics and Mathematical Physics6(5), 1–50 (1966).https://doi.org/10.1016/0041-5553(66) 90114-5 on Pithdoi:10.1016/0041-5553(66
  17. [36] Lin, Z., Li, H., Fang, C.: Accelerated Optimization for Machine Learning: First-Order Algorithms. Springer, Singapore (2020).https://doi.org/10.1007/978-981-15-2910-8 on Pithdoi:10.1007/978-981-15-2910-8
  18. [37] Luke, D.R., Shefi, R.: A globally linearly convergent method for pointwise quadratically supportable convex–concave saddle point problems. Journal of Mathematical Analysis and Applications457(2), 1568–1590 (2018).https://doi.org/10.1016/j.jmaa.2017.02.068 on Pithdoi:10.1016/j.jmaa.2017.02.068
  19. [38] Luo, H.: A primal-dual flow for affine constrained convex optimization. ESAIM: Control, Optimisa- tion and Calculus of Variations28, 33 (2022).https://doi.org/10.1051/cocv/2022032 on Pithdoi:10.1051/cocv/2022032
  20. [39] Luo, H.: Accelerated primal-dual methods for linearly constrained convex optimization prob- lems. Journal of Global Optimization95(2), 405–437 (2026).https://doi.org/10.1007/ s10898-026-01621-w on Pith
  21. [40] Nesterov, Y .: Introductory Lectures on Convex Optimization: A Basic Course, Applied Op- timization, vol. 87. Springer, New York, NY (2004).https://doi.org/10.1007/ 978-1-4419-8853-9 on Pith
  22. [41] Ouyang, Y ., Chen, Y ., Lan, G., Pasiliao Jr., E.: An accelerated linearized alternating direction method of multipliers. SIAM Journal on Imaging Sciences8(1), 644–681 (2015).https://doi.org/ 10.1137/14095697X on Pithdoi:10.1137/14095697x
  23. [42] Patrascu, A., Necoara, I.: On the convergence of inexact projection primal first-order methods for convex minimization. IEEE Transactions on Automatic Control63(10), 3317–3329 (2018).https: //doi.org/10.1109/TAC.2018.2805727 on Pithdoi:10.1109/tac.2018.2805727
  24. [43] Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: R. Fletcher (ed.) Optimization, pp. 283–298. Academic Press, London (1969) on Pith
  25. [44] Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Mathematics of Operations Research1(2), 97–116 (1976).https://doi.org/ 10.1287/moor.1.2.97 on Pithdoi:10.1287/moor.1.2.97
  26. [46] Song, Y ., Yuan, X., Yue, H.: An inexact Uzawa algorithmic framework for nonlinear saddle point problems with applications to elliptic optimal control problem. SIAM Journal on Numerical Analysis 57(6), 2656–2684 (2019).https://doi.org/10.1137/19M1245736. 34 Long Chen, Jingrong Wei on Pithdoi:10.1137/19m1245736
  27. [47] Srivastava, P., Cort ´es, J.: Nesterov acceleration for equality-constrained convex optimization via con- tinuously differentiable penalty functions. IEEE Control Systems Letters5(2), 415–420 (2021). https://doi.org/10.1109/LCSYS.2020.3002687 on Pithdoi:10.1109/lcsys.2020.3002687
  28. [48] Taylor, A., Drori, Y .: An optimal gradient method for smooth strongly convex minimiza- tion. Mathematical Programming199(1–2), 557–594 (2023).https://doi.org/10.1007/ s10107-022-01839-y on Pith
  29. [49] Tran-Dinh, Q., Fercoq, O., Cevher, V .: A smooth primal-dual optimization framework for nonsmooth composite convex minimization. SIAM Journal on Optimization28(1), 96–134 (2018).https: //doi.org/10.1137/16M1093094 on Pithdoi:10.1137/16m1093094
  30. [50] Wang, M., Chen, L.: Multigrid methods for the Stokes equations using distributive Gauss–Seidel relaxations based on the least squares commutator. Journal of Scientific Computing56(2), 409–431 (2013).https://doi.org/10.1007/s10915-013-9684-1 on Pithdoi:10.1007/s10915-013-9684-1
  31. [51] Wei, J., Chen, L.: Accelerated over-relaxation heavy-ball method: Achieving global accelerated con- vergence with broad generalization. In: Y . Yue, A. Garg, N. Peng, F. Sha, R. Yu (eds.) The Thir- teenth International Conference on Learning Representations, pp. 98490–98517. I... on Pith
  32. [52] Wright, S.J.: Optimization in theory and practice. arXiv preprint arXiv:2510.15734 (2025). URL https://arxiv.org/abs/2510.15734 on PitharXiv
  33. [53] Xu, Y .: Accelerated first-order primal-dual proximal methods for linearly constrained composite con- vex programming. SIAM Journal on Optimization27(3), 1459–1484 (2017).https://doi.org/ 10.1137/16M1082305 on Pithdoi:10.1137/16m1082305

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment