scientific article; zbMATH DE number 3494173
From MaRDI portal
Publication:4077092
Cited in
(54)- Proximal-point algorithm using a linear proximal term
- Newton's method for singular constrained optimization problems
- A characterization of best complex rational approximants in a fundamental case
- A cyclic projection algorithm via duality
- Piecewise linear optimization
- A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems
- A cutting-plane algorithm with linear and geometric rates of convergence
- Zur Bewertung von Schätzungen bei der gewöhnlichen Regressionsanalyse
- Estimating matrices
- Comparing sweep strategies for stochastic relaxation
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- On the approximate solution of nonlinear variational inequalities
- Higher order necessary conditions in abstract mathematical programming
- Duality and regularization for inf-sup problems
- On a class of iterative projection and contraction methods for linear programming
- New contraction methods for linear inequalities
- Some outer approximation methods for semi-infinite optimization problems
- Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- On the optimal linear convergence rate of a generalized proximal point algorithm
- On self-concordant barrier functions for conic hulls and fractional programming
- On inequality constrained generalized least squares selections in the general possibly singular Gauss-Markov model: A projector theoretical approach
- A parallel splitting ALM-based algorithm for separable convex programming
- On the iteration complexity of some projection methods for monotone linear variational inequalities
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization
- A proximal point algorithm revisit on the alternating direction method of multipliers
- A variable metric proximal-descent algorithm for monotone operators
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- On Haar's dual problem
- A customized proximal point algorithm for convex minimization with linear constraints
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- Convergence study on the symmetric version of ADMM with larger step sizes
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- A strictly contractive Peaceman-Rachford splitting method with logarithmic-quadratic proximal regularization for convex programming
- Results of farkas type
- Characterization of weakly efficient points
- On Linear Convergence of a Class of Random Search Algorithms
- On Linear Convergence of a Class of Random Search Algorithms
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A proximal fully parallel splitting method with a relaxation factor for separable convex programming
- Convergence analysis of the indefinite proximal augmented Lagrange method under strongly convex conditions
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- A class of ADMM-based algorithms for three-block separable convex programming
- A note on constraint qualification for saddle point conditions involving convex and linear affine functions
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- A proximal point-like method for symmetric finite element model updating problems
- Inequality systems and optimization
- Steplengths in the extragradient type methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077092)
