| Publication | Date of Publication | Type |
|---|
| Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints | 2024-02-23 | Paper |
| Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming | 2024-01-17 | Paper |
| An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems | 2023-10-17 | Paper |
| Average curvature FISTA for nonconvex smooth composite optimization problems | 2023-08-03 | Paper |
| An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems | 2023-06-07 | Paper |
| Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function | 2023-03-30 | Paper |
| Proximal bundle methods for hybrid weakly convex composite optimization problems | 2023-03-26 | Paper |
| Projection-free accelerated method for convex optimization | 2022-09-29 | Paper |
| A single cut proximal bundle method for stochastic convex composite optimization | 2022-07-18 | Paper |
| Dimension Reduction and Coefficient Estimation in Multivariate Linear Regression | 2022-07-11 | Paper |
| Accelerated inexact composite gradient methods for nonconvex spectral optimization problems | 2022-06-27 | Paper |
| A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes | 2021-12-01 | Paper |
| An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems | 2021-11-05 | Paper |
| A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems | 2021-10-03 | Paper |
| Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems | 2021-09-24 | Paper |
| A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems | 2021-08-09 | Paper |
| FISTA and Extensions -- Review and New Insights | 2021-07-02 | Paper |
| Stochastic dynamic cutting plane for multistage stochastic convex programs | 2021-06-15 | Paper |
| Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems | 2021-02-19 | Paper |
| An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems | 2021-02-02 | Paper |
| Iteration-complexity of an inner accelerated inexact proximal augmented Lagrangian method based on the classical Lagrangian function | 2020-08-02 | Paper |
| Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems | 2020-06-14 | Paper |
| An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems | 2020-05-19 | Paper |
| A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes | 2020-03-25 | Paper |
| On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM | 2020-03-25 | Paper |
| Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs | 2019-10-17 | Paper |
| An accelerated inexact proximal point method for solving nonconvex-concave min-max problems | 2019-05-31 | Paper |
| A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems | 2018-11-27 | Paper |
| Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators | 2018-07-20 | Paper |
| An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems | 2017-11-24 | Paper |
| Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs | 2017-05-19 | Paper |
| Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework | 2017-03-10 | Paper |
| Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds | 2016-12-13 | Paper |
| Extending the ergodic convergence rate of the proximal ADMM | 2016-11-09 | Paper |
| An adaptive accelerated first-order method for convex optimization | 2016-05-04 | Paper |
| Iteration-complexity of first-order augmented Lagrangian methods for convex programming | 2016-02-23 | Paper |
| An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems | 2016-01-21 | Paper |
| Improved pointwise iteration-complexity of a regularized ADMM and of a regularized non-Euclidean HPE framework | 2016-01-06 | Paper |
| A first-order block-decomposition method for solving two-easy-block structured semidefinite programs | 2015-11-19 | Paper |
| Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems | 2015-11-18 | Paper |
| A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities | 2015-11-04 | Paper |
| Regularized HPE-type methods for solving monotone inclusions with improved pointwise iteration-complexity bounds | 2015-09-08 | Paper |
| Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems | 2014-02-25 | Paper |
| An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods | 2013-09-25 | Paper |
| Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers | 2013-06-27 | Paper |
| Iteration-complexity of first-order penalty methods for convex programming | 2013-05-06 | Paper |
| Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems | 2013-01-04 | Paper |
| Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems | 2012-03-16 | Paper |
| Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression | 2012-02-22 | Paper |
| On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean | 2011-03-21 | Paper |
| Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming | 2011-02-14 | Paper |
| A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming | 2009-11-27 | Paper |
| An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners | 2009-02-18 | Paper |
| A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms | 2008-06-30 | Paper |
| Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming | 2008-01-21 | Paper |
| Dual convergence of the proximal point method with Bregman distances for linear programming | 2007-09-03 | Paper |
| A modified nearly exact method for solving low-rank trust region subproblem | 2007-03-05 | Paper |
| Large-scale semidefinite programming via a saddle point mirror-prox algorithm | 2007-03-05 | Paper |
| An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming | 2006-05-30 | Paper |
| A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm | 2005-09-16 | Paper |
| Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2 | 2005-09-16 | Paper |
| A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh--Haeberly--Overton Search Direction | 2005-09-16 | Paper |
| Asymptotic behavior of the central path for a special class of degenerate SDP problems | 2005-08-08 | Paper |
| Local minima and convergence in low-rank semidefinite programming | 2005-08-08 | Paper |
| Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods | 2005-02-23 | Paper |
| A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming | 2004-08-16 | Paper |
| A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming | 2004-01-19 | Paper |
| A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization | 2003-10-29 | Paper |
| A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs | 2003-10-29 | Paper |
| First- and second-order methods for semidefinite programming | 2003-09-01 | Paper |
| Maximum stable set formulations and heuristics based on continuous optimization | 2003-07-13 | Paper |
| Solving a class of semidefinite programs via nonlinear programming | 2002-12-01 | Paper |
| Interior-point algorithms for semidefinite programming based on a nonlinear formulation | 2002-08-19 | Paper |
| Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs | 2002-04-23 | Paper |
| On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems | 2001-11-26 | Paper |
| General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems | 2001-11-26 | Paper |
| On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances | 2001-11-26 | Paper |
| Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants | 2001-04-02 | Paper |
| A projected gradient algorithm for solving the maxcut SDP relaxation | 2001-01-01 | Paper |
| Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions | 2000-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4517105 | 2000-11-23 | Paper |
| Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions | 2000-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703909 | 1999-12-01 | Paper |
| Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming | 1999-11-24 | Paper |
| A Potential Reduction Newton Method for Constrained Equations | 1999-11-24 | Paper |
| A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming | 1999-06-03 | Paper |
| Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions | 1998-09-21 | Paper |
| On the existence and convergence of the central path for convex programming and some duality results | 1998-07-29 | Paper |
| Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming | 1998-05-12 | Paper |
| Nondegeneracy of polyhedra and linear programs | 1998-04-05 | Paper |
| Trust region affine scaling algorithms for linearly constrained convex and concave programs | 1998-03-11 | Paper |
| Primal--Dual Path-Following Algorithms for Semidefinite Programming | 1998-02-10 | Paper |
| A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming | 1997-10-23 | Paper |
| On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs | 1997-10-20 | Paper |
| Superlinear convergence of the affine scaling algorithm | 1997-09-15 | Paper |
| Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem | 1997-08-04 | Paper |
| Properties of an Interior-Point Mapping for Mixed Complementarity Problems | 1996-12-01 | Paper |
| An interior point potential reduction method for constrained equations | 1996-11-24 | Paper |
| A general parametric analysis approach and its implication to sensitivity analysis in interior point methods | 1996-07-28 | Paper |
| A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP | 1996-05-13 | Paper |
| Superlinear primal-dual affine scaling algorithms for LCP | 1996-04-10 | Paper |
| A Positive Algorithm for the Nonlinear Complementarity Problem | 1995-05-04 | Paper |
| A globally convergent primal-dual interior point algorithm for convex programming | 1994-08-10 | Paper |
| Local convergence of interior-point algorithms for degenerate monotone LCP | 1994-05-18 | Paper |
| A simplified global convergence proof of the affine scaling algorithm | 1994-02-07 | Paper |
| On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming | 1993-01-16 | Paper |
| A geometric view of parametric linear programming | 1992-09-27 | Paper |
| Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming | 1992-06-28 | Paper |
| Limiting behavior of the affine scaling continuous trajectories for linear programming problems | 1991-01-01 | Paper |
| A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension | 1990-01-01 | Paper |
| An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202841 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202842 | 1990-01-01 | Paper |
| Interior path following primal-dual algorithms. I: Linear programming | 1989-01-01 | Paper |
| Interior path following primal-dual algorithms. II: Convex quadratic programming | 1989-01-01 | Paper |
