An augmented Lagrangian primal-dual semismooth Newton method for multi-block composite optimization
From MaRDI portal
Cites work
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
- A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
- A semismooth Newton method with multidimensional filter globalization for l₁-optimization
- A semismooth Newton-type method for the nearest doubly stochastic matrix problem
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- A stochastic semismooth Newton method for nonsmooth nonconvex optimization
- Active Sets, Nonsmoothness, and Sensitivity
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- An inexact semismooth Newton method on Riemannian manifolds with application to duality-based total variation denoising
- Convergence rate analysis of several splitting schemes
- Convergence Results for Primal-Dual Algorithms in the Presence of Adjoint Mismatch
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Factorization strategies for third-order tensors
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Geometric approach to convex subdifferential calculus
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Inexact Levenberg-Marquardt method for nonlinear equations
- Local uniqueness and convergence of iterative methods for nonsmooth variational inequalities
- Newton acceleration on manifolds identified by proximal gradient methods
- Optimality, identifiability, and sensitivity
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Robust tensor completion: equivalent surrogates, error bounds, and algorithms
- Semismooth and Semiconvex Functions in Constrained Optimization
- Semismooth Matrix-Valued Functions
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Some continuity properties of polyhedral multifunctions
- Superlinear convergence of a Newton-type algorithm for monotone equations
- Traces and Emergence of Nonlinear Programming
This page was built for publication: An augmented Lagrangian primal-dual semismooth Newton method for multi-block composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028730)
