An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
From MaRDI portal
Publication:1256399
DOI10.2140/pjm.1980.88.101zbMath0403.90081MaRDI QIDQ1256399
Publication date: 1980
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1980.88.101
90C25: Convex programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Steepest descent evolution equations: asymptotic behavior of solutions and rate of convergence, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, Limiting behavior of the central path in semidefinite optimization, Enhancing the behavior of interior-point methods via identification of variables, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, Two simple proofs for analyticity of the central path in linear programming., Local behavior of the Newton method on two equivalent systems from linear programming, Convergence behavior of interior-point algorithms, Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming., Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Generalized linear complementarity problems treated without fixed-point theory, A new continuation method for complementarity problems with uniform P- functions, Degeneracy in interior point methods for linear programming: A survey, Interior proximal point algorithm for linear programs, Modified predictor-corrector algorithm for locating weighted centers in linear programming, Limiting behavior of weighted central paths in linear programming, The asymptotic optimal partition and extensions of the nonsubstitution theorem, Examples of ill-behaved central paths in convex optimization, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method, Analytic centers and repelling inequalities, Primal-dual target-following algorithms for linear programming, Identifying an optimal basis in linear programming, Interior-point methods for nonlinear complementarity problems, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, Sensitivity analysis for variational inequalities and nonlinear complementarity problems, On some properties and an application of the logarithmic barrier method, Asymptotic behavior of the central path for a special class of degenerate SDP problems, Analysis for a homotopy path of complementarity problems based on \(\mu\)-exceptional family, Polyhedral extensions of some theorems of linear programming, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
