Pages that link to "Item:Q1256399"

The following pages link to An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem (Q1256399):

Displayed 31 items.

• Convergence behavior of interior-point algorithms (Q689124) ‎ (← links)
• Sphere of convergence of Newton's method on two equivalent systems from nonlinear programming. (Q703159) ‎ (← links)
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) ‎ (← links)
• Generalized linear complementarity problems treated without fixed-point theory (Q1054640) ‎ (← links)
• A new continuation method for complementarity problems with uniform P- functions (Q1121180) ‎ (← links)
• Degeneracy in interior point methods for linear programming: A survey (Q1312753) ‎ (← links)
• Interior proximal point algorithm for linear programs (Q1321229) ‎ (← links)
• Modified predictor-corrector algorithm for locating weighted centers in linear programming (Q1321467) ‎ (← links)
• Limiting behavior of weighted central paths in linear programming (Q1338144) ‎ (← links)
• The asymptotic optimal partition and extensions of the nonsubstitution theorem (Q1765893) ‎ (← links)
• Examples of ill-behaved central paths in convex optimization (Q1777216) ‎ (← links)
• Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. (Q1807690) ‎ (← links)
• On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method (Q1816897) ‎ (← links)
• Analytic centers and repelling inequalities (Q1848382) ‎ (← links)
• Primal-dual target-following algorithms for linear programming (Q1915912) ‎ (← links)
• Identifying an optimal basis in linear programming (Q1915926) ‎ (← links)
• Interior-point methods for nonlinear complementarity problems (Q1918290) ‎ (← links)
• Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights (Q1977257) ‎ (← links)
• Sensitivity analysis for variational inequalities and nonlinear complementarity problems (Q2276887) ‎ (← links)
• On some properties and an application of the logarithmic barrier method (Q2467165) ‎ (← links)
• Asymptotic behavior of the central path for a special class of degenerate SDP problems (Q2487847) ‎ (← links)
• Analysis for a homotopy path of complementarity problems based on \(\mu\)-exceptional family (Q2572367) ‎ (← links)
• Polyhedral extensions of some theorems of linear programming (Q3959739) ‎ (← links)
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems (Q4240625) ‎ (← links)
• Steepest descent evolution equations: asymptotic behavior of solutions and rate of convergence (Q4269096) ‎ (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) ‎ (← links)
• Limiting behavior of the central path in semidefinite optimization (Q5312757) ‎ (← links)
• Enhancing the behavior of interior-point methods via identification of variables (Q5426974) ‎ (← links)
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming (Q5437530) ‎ (← links)
• Two simple proofs for analyticity of the central path in linear programming. (Q5937499) ‎ (← links)
• Local behavior of the Newton method on two equivalent systems from linear programming (Q5959909) ‎ (← links)