Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems
- On Rockafellar's theorem using proximal point algorithm involving H-maximal monotonicity framework
- Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions
- Proximal point algorithms for general variational inequalities
- Role of relative \(A\)-maximal monotonicity in overrelaxed proximal-point algorithms with Applications
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
- General proximal point algorithm involving -maximal accretiveness framework in Banach spaces
- Duality and existence theory for nondifferentiable programming
- A primal-dual projection method for solving systems of linear inequalities
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Penalty-proximal methods in convex programming
- Homotopy techniques in linear programming
- Morse theory for some lower-C^ 2 functions in finite dimension
- Implementing proximal point methods for linear programming
- Continuous regularized variable-metric proximal minimization method
- Decomposition algorithm for convex differentiable minimization
- Extended scenario analysis
- A mixed formulation for frictional contact problems prone to Newton like solution methods
- A necessary and sufficient condition for convergence of steepest descent approximation to accretive operator equations
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Progressive regularization of variational inequalities and decomposition algorithms
- Proximal methods in view of interior-point strategies
- Prox-regularization and solution of ill-posed elliptic variational inequalities
- A variable-penalty alternating directions method for convex optimization
- Newton's method for linear inequality systems
- Error bounds and convergence analysis of feasible descent methods: A general approach
- The perturbed proximal point algorithm and some of its applications
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- Proximal minimization algorithm with \(D\)-functions
- Augmented Lagrangian algorithms for linear programming
- Partial linearization methods in nonlinear programming
- Parallel alternating direction multiplier decomposition of convex programs
- Convergence of some algorithms for convex minimization
- A unified description of iterative algorithms for traffic equilibria
- Data parallel computing for network-structured optimization problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- Duality of regularizations and hullfunctions for mathematical programming problems
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Decomposition methods in stochastic programming
- A proximal point algorithm for minimax problems
- Coupling the auxiliary problem principle with descent methods of pseudoconvex programming
- A set-valued force law for spatial Coulomb--Contensou friction.
- Nonlinear proximal decomposition method for convex programming
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models
- Monotone operator theory in convex optimization
- Alternating direction method of multipliers for separable convex optimization of real functions in complex variables
- Convergence theorems of common elements for pseudocontractive mappings and monotone mappings
- A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning
- The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
- A partially parallel prediction-correction splitting method for convex optimization problems with separable structure
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
- Preconditioned ADMM for a class of bilinear programming problems
- An implementable first-order primal-dual algorithm for structured convex optimization
- A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem
- Convergence of the augmented decomposition algorithm
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- On the optimal linear convergence rate of a generalized proximal point algorithm
- Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
- A primal-dual regularized interior-point method for convex quadratic programs
- A primal-dual proximal point algorithm for constrained convex programs
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
- A parameterized proximal point algorithm for separable convex optimization
- Computational schemes for large-scale problems in extended linear- quadratic programming
- The adventures of a simple algorithm
- On linear convergence of iterative methods for the variational inequality problem
- Maxmin subject to marginal constraints
- A continuation method for monotone variational inequalities
- Generalized proximal point algorithm for convex optimization
- On the twice differentiable cubic augmented Lagrangian
- A quasi-second-order proximal bundle algorithm
- On augmented Lagrangian decomposition methods for multistage stochastic programs
- Solving multistage stochastic network programs on massively prallel computers
- A primal-dual approach to inexact subgradient methods
- Descentwise inexact proximal algorithms for smooth optimization
- A modified proximal point algorithm with errors for approximating solution of the general variational inclusion
- Accelerated linearized Bregman method
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration
- Prediction-correction alternating direction method for a class of constrained min-max problems
- A Gauss-Seidel like algorithm to solve frictional contact problems
- Large deformation frictional contact mechanics: Continuum formulation and augmented Lagrangian treatment
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- A wavelet frame approach for removal of mixed Gaussian and impulse noise on surfaces
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints
- Proximal point algorithms for zero points of nonlinear operators
- Some results on an infinite family of accretive operators in a reflexive Banach space
- An interior point-proximal method of multipliers for convex quadratic programming
- Bounds for the tracking error of first-order online optimization methods
- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems
- Generalized Krasnoselskii-Mann-type iteration for nonexpansive mappings in Banach spaces
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- An approximate augmented Lagrangian method for nonnegative low-rank matrix approximation
- A first-order image restoration model that promotes image contrast preservation
- Total generalized variation denoising of speckled images using a primal-dual algorithm
This page was built for publication: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187592)
