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.90081OpenAlexW1966000604MaRDI 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
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Analysis of some interior point continuous trajectories for convex programming, Limiting behavior of weighted central paths in linear programming, Steepest descent evolution equations: asymptotic behavior of solutions and rate of convergence, Limiting behavior of the central path in semidefinite optimization, Primal-dual target-following algorithms for linear programming, Identifying an optimal basis in linear programming, Interior-point methods for nonlinear complementarity problems, A new continuation method for complementarity problems with uniform P- functions, On the pricing of multi-asset options under jump-diffusion processes using meshfree moving least-squares approximation, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, The Convergent Generalized Central Paths for Linearly Constrained Convex Programming, On some properties and an application of the logarithmic barrier method, Convergence behavior of interior-point algorithms, The asymptotic optimal partition and extensions of the nonsubstitution theorem, Asymptotic behavior of the central path for a special class of degenerate SDP problems, Two simple proofs for analyticity of the central path in linear programming., Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming., Enhancing the behavior of interior-point methods via identification of variables, Examples of ill-behaved central paths in convex optimization, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, Sensitivity analysis for variational inequalities and nonlinear complementarity problems, Local behavior of the Newton method on two equivalent systems from linear programming, Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems., Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method, Analysis for a homotopy path of complementarity problems based on \(\mu\)-exceptional family, Analytic centers and repelling inequalities, Generalized linear complementarity problems treated without fixed-point theory, Degeneracy in interior point methods for linear programming: A survey, Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, An interior point parameterized central path following algorithm for linearly constrained convex programming, Interior proximal point algorithm for linear programs, Modified predictor-corrector algorithm for locating weighted centers in linear programming, Polyhedral extensions of some theorems of linear programming
