Publication:4951043
From MaRDI portal
Publication:4951043
{{DISPLAYTITLE:Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
DOI10.1287/moor.24.3.645zbMath1039.90518OpenAlexW2132488568MaRDI QIDQ4951043
Alfred Auslender, Sami Ben-Tiba, Marc Teboulle
Publication date: 1999
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.24.3.645
Related Items
LQP method with a new optimal step size rule for nonlinear complementarity problems, The interior proximal extragradient method for solving equilibrium problems, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, An inexact proximal method for quasiconvex minimization, Decomposition Methods Based on Augmented Lagrangians: A Survey, A simplified view of first order methods for optimization, Building initial partitions through sampling techniques, Nonlinear rescaling as interior quadratic prox method in convex optimization, Variants for the logarithmic-quadratic proximal point scalarization method for multiobjective programming, An inexact algorithm with proximal distances for variational inequalities, Unnamed Item, An inexact scalarization proximal point method for multiobjective quasiconvex minimization, Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier, An extension of proximal methods for quasiconvex minimization on the nonnegative orthant, Rescaled proximal methods for linearly constrained convex problems, A new predicto-corrector method for pseudomonotone nonlinear complementarity problems, Modified proximal-point method for nonlinear complementarity problems, An LQP method for pseudomonotone variational inequalities, Modified Lagrangian methods for separable optimization problems, Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming, A generalized proximal-point-based prediction-correction method for variational inequality problems, Nonmonotone projected gradient methods based on barrier and Euclidean distances, A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem, Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints, Numerical treatment of an asset price model with non-stochastic uncertainty. (With comments and rejoinder)., Numerical comparison of augmented Lagrangian algorithms for nonconvex problems, INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES, Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis, Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization., Proximal methods for nonlinear programming: Double regularization and inexact subproblems, Interior proximal method for variational inequalities: Case of nonparamonotone operators, An interior proximal point algorithm for nonlinear complementarity problems, Dual convergence of the proximal point method with Bregman distances for linear programming, Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization, A proximal multiplier method for separable convex minimization, Double-regularization proximal methods, with complementarity applications, A new logarithmic-quadratic proximal method for nonlinear complementarity problems, Primal–dual exterior point method for convex optimization, Interior hybrid proximal extragradient methods for the linear monotone complementarity problem, A minimization algorithm for equilibrium problems with polyhedral constraints, An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant, Weak and strong convergence of proximal penalization and proximal splitting algorithms for two-level hierarchical Ky Fan minimax inequalities, Interior projection-like methods for monotone variational inequalities, Lagrangian transformation and interior ellipsoid methods in convex optimization, Nonlinear proximal decomposition method for convex programming
