Some properties of generalized proximal point methods for quadratic and linear programming
From MaRDI portal
Publication:1896573
DOI10.1007/BF02193058zbMATH Open0831.90092MaRDI QIDQ1896573FDOQ1896573
Authors: Alfredo Iusem 
Publication date: 4 September 1995
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
- Dual convergence of the proximal point method with Bregman distances for linear programming
- On some properties of generalized proximal point methods for variational inequalities
- Implementing proximal point methods for linear programming
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Convex Analysis
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- On the convergence of the exponential multiplier method for convex programming
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Title not available (Why is that?)
- Proximal minimization algorithm with \(D\)-functions
- On the convergence rate of entropic proximal optimization methods
- Entropy-Like Proximal Methods in Convex Programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Multiplicative iterative algorithms for convex programming
- A relaxed version of Bregman's method for convex programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
Cited In (21)
- A generalized like-distance in convex programming
- Implementing proximal point methods for linear programming
- A note on the existence of zeroes of convexly regularized sums of maximal monotone operators
- A proximal method with logarithmic barrier for nonlinear complementarity problems
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- An interior point-proximal method of multipliers for convex quadratic programming
- On a generalized proximal point method for solving equilibrium problems in Banach spaces
- On inexact generalized proximal methods with a weakened error tolerance criterion
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming
- Equilibrium programming using proximal-like algorithms
- Newton-type Methods with Generalized Distances For Constrained Optimization
- Re-examination of Bregman functions and new properties of their divergences
- On some properties of generalized proximal point methods for variational inequalities
- Dual convergence of the proximal point method with Bregman distances for linear programming
- Proximal Methods with Penalization Effects in Banach Spaces
- Modified proximal point algorithm for extended linear-quadratic programming
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming
- A generalized proximal-point-based prediction-correction method for variational inequality problems
- Inexact proximal point algorithms and descent methods in optimization
- Construction of proximal distances over symmetric cones
This page was built for publication: Some properties of generalized proximal point methods for quadratic and linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896573)
