An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities

DOI10.1007/BF01592246zbMath0855.90095MaRDI QIDQ1924060

Alfred Auslender, Mounir Haddou

Publication date: 24 November 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

maximal monotone operatorinterior algorithmconvex linearly constrained problemsentropy-like proximal methodminimization of a convex functionvariational inequalities on polyhedra

Mathematics Subject Classification ID

Convex programming (90C25) Variational inequalities (49J40)

Related Items

A note on the existence of zeroes of convexly regularized sums of maximal monotone operators ⋮ Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems ⋮ New cooperative projection neural network for nonlinearly constrained variational inequality ⋮ An self-adaptive LQP method for constrained variational inequalities ⋮ The prediction-correction approach to nonlinear complementarity problems ⋮ A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities ⋮ The developments of proximal point algorithms ⋮ Equilibrium programming using proximal-like algorithms ⋮ On the linear convergence of a Bregman proximal point algorithm ⋮ Subgradient method with entropic projections for convex nondifferentiable minimization ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm ⋮ Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games ⋮ Interior proximal methods for quasiconvex optimization ⋮ Rescaled proximal methods for linearly constrained convex problems ⋮ An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems ⋮ An APPA-based descent method with optimal step-sizes for monotone variational inequalities ⋮ An inexact logarithmic-quadratic proximal augmented Lagrangian method for a class of constrained variational inequalities ⋮ Computing proximal points of nonconvex functions ⋮ A new criterion for the inexact logarithmic-quadratic proximal method and its derived hybrid methods ⋮ Extended LQP method for monotone nonlinear complementarity problems ⋮ Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder). ⋮ Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces ⋮ Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. ⋮ Self-adaptive projection-based prediction-correction method for constrained variational inequalities ⋮ An improved LQP-based method for solving nonlinear complementarity problems ⋮ Interior proximal method for variational inequalities: Case of nonparamonotone operators ⋮ A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems ⋮ Asymptotic analysis for proximal-type methods in vector variational inequality problems ⋮ Interior proximal methods and central paths for convex second-order cone programming ⋮ Competitive facility location on decentralized supply chains ⋮ Proximal point algorithms for general variational inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Multiplicative iterative algorithms for convex programming
• A new polynomial-time algorithm for linear programming
• On the maximal domain of a monotone function
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• A polynomial-time algorithm, based on Newton's method, for linear programming
• New trajectory-following polynomial-time algorithm for linear programming problems
• A polynomial-time algorithm for a class of linear complementarity problems
• Interior point algorithms for linear programming with inequality constraints
• Image d'une somme d'opérateurs monotones et applications
• Proximal minimization algorithm with \(D\)-functions
• Asymptotic analysis of the exponential penalty trajectory in linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem
• Path-Following Methods for Linear Programming
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Perturbation des méthodes d'optimisation. Applications
• Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Entropy-Like Proximal Methods in Convex Programming
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Convex Analysis
• On the Maximality of Sums of Nonlinear Monotone Operators