A proximal point algorithm with asymmetric linear term
From MaRDI portal
Recommendations
- Proximal-point algorithm using a linear proximal term
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
- An abstract proximal point algorithm
- A proximal point algorithm revisited and extended
- A Generalization of the Proximal Point Algorithm
- Relatively inexact proximal point algorithm and linear convergence analysis
- The proximal point algorithm revisited
- Inexact Halpern-type proximal point algorithm
- Implementing proximal point methods for linear programming
- On the proximal point algorithm
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 3223095 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- A class of nonlinear proximal point algorithms for variational inequality problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A generalized proximal-point-based prediction-correction method for variational inequality problems
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- A logarithmic-quadratic proximal method for variational inequalities
- A new accuracy criterion for approximate proximal point algorithms
- A new hybrid generalized proximal point algorithm for variational inequality problems
- An improved first-order primal-dual algorithm with a new correction step
- Approximate iterations in Bregman-function-based proximal algorithms
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convergence of Proximal-Like Algorithms
- Convex programming in Hilbert space
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Multiplier and gradient methods
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the convergence of primal-dual hybrid gradient algorithm
- Proximal minimization algorithm with \(D\)-functions
- Proximal-point algorithm using a linear proximal term
Cited in
(7)- Improved accelerated gradient algorithms with line search for smooth convex optimization problems
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Proximal-point algorithm using a linear proximal term
- Linear and superlinear convergence of an inexact algorithm with proximal distances for variational inequality problems
- The indefinite proximal point algorithms for maximal monotone operators
- A general framework for symmetric and asymmetric variable metric proximal point methods, with relations between relative-errors and summable-errors
- The developments of proximal point algorithms
This page was built for publication: A proximal point algorithm with asymmetric linear term
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311109)
