Dual–primal proximal point algorithms for extended convex programming
From MaRDI portal
Publication:5266145
DOI10.1080/00207160.2014.945920zbMath1317.65147OpenAlexW2014038035MaRDI QIDQ5266145
Zhikai Jiang, Min Li, Zhangjin Zhou
Publication date: 30 July 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.945920
Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (2)
A class of customized proximal point algorithms for linearly constrained convex optimization ⋮ Nonlinear least square based on control direction by dual method and its application
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- A primal-dual proximal point algorithm for constrained convex programs
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Decomposition Methods Based on Augmented Lagrangians: A Survey
- A Singular Value Thresholding Algorithm for Matrix Completion
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
This page was built for publication: Dual–primal proximal point algorithms for extended convex programming
