scientific article; zbMATH DE number 3494173
From MaRDI portal
Publication:4077092
zbMath0315.90062MaRDI QIDQ4077092
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (52)
New contraction methods for linear inequalities ⋮ Some outer approximation methods for semi-infinite optimization problems ⋮ On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming ⋮ Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes ⋮ A characterization of best complex rational approximants in a fundamental case ⋮ A customized proximal point algorithm for convex minimization with linear constraints ⋮ Steplengths in the extragradient type methods ⋮ A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming ⋮ An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing ⋮ Results of farkas type ⋮ A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging ⋮ On the iteration complexity of some projection methods for monotone linear variational inequalities ⋮ On inequality constrained generalized least squares selections in the general possibly singular Gauss-Markov model: A projector theoretical approach ⋮ Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation ⋮ A cyclic projection algorithm via duality ⋮ Customized alternating direction methods of multipliers for generalized multi-facility Weber problem ⋮ A proximal fully parallel splitting method with a relaxation factor for separable convex programming ⋮ 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 ⋮ Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization ⋮ Zur Bewertung von Schätzungen bei der gewöhnlichen Regressionsanalyse ⋮ 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 ⋮ An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems ⋮ Estimating matrices ⋮ A proximal point algorithm revisit on the alternating direction method of multipliers ⋮ 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 ⋮ Comparing sweep strategies for stochastic relaxation ⋮ Characterization of weakly efficient points ⋮ A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming ⋮ On the optimal linear convergence rate of a generalized proximal point algorithm ⋮ On Linear Convergence of a Class of Random Search Algorithms ⋮ Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems ⋮ On the approximate solution of nonlinear variational inequalities ⋮ A class of ADMM-based algorithms for three-block separable convex programming ⋮ Higher order necessary conditions in abstract mathematical programming ⋮ A variable metric proximal-descent algorithm for monotone operators ⋮ The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent ⋮ Generalized alternating direction method of multipliers: new theoretical insights and applications ⋮ 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 ⋮ Duality and regularization for inf-sup problems ⋮ A parallel splitting ALM-based algorithm for separable convex programming ⋮ On self-concordant barrier functions for conic hulls and fractional programming ⋮ On Linear Convergence of a Class of Random Search Algorithms ⋮ Proximal-point algorithm using a linear proximal term ⋮ On Haar's dual problem ⋮ Newton's method for singular constrained optimization problems ⋮ Inequality systems and optimization ⋮ On a class of iterative projection and contraction methods for linear programming
This page was built for publication:
