Pages that link to "Item:Q4302318"
From MaRDI portal
The following pages link to Extension of Hoffman’s Error Bound to Polynomial Systems (Q4302318):
Displaying 50 items.
- Error bounds for mixed integer linear optimization problems (Q263186) (← links)
- Error bounds for mixed integer nonlinear optimization problems (Q315475) (← links)
- Exact penalty and error bounds in DC programming (Q427389) (← links)
- Asymptotical good behavior on inequalities with completely approximate K-T concept (Q435757) (← links)
- Error bounds of constrained quadratic functions and piecewise affine inequality systems (Q597211) (← links)
- Error bounds via exact penalization with applications to concave and quadratic systems (Q727233) (← links)
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors (Q747767) (← links)
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions (Q959926) (← links)
- Error bounds for systems of lower semicontinuous functions in Asplund spaces (Q959949) (← links)
- Vector variational inequalities involving set-valued mappings via scalarization with applications to error bounds for gap functions (Q987510) (← links)
- Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems (Q1290664) (← links)
- Newton's method for linear inequality systems (Q1296136) (← links)
- Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Error bounds for the solution sets of quadratic complementarity problems (Q1626539) (← links)
- Analysis of classifiers' robustness to adversarial perturbations (Q1640392) (← links)
- From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
- Error bound results for convex inequality systems via conjugate duality (Q1939069) (← links)
- Global error bounds for piecewise convex polynomials (Q1942267) (← links)
- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems (Q2007835) (← links)
- A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging (Q2051043) (← links)
- Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
- Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces (Q2116030) (← links)
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games (Q2155890) (← links)
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty (Q2188944) (← links)
- Bounds on the objective value of feasible roundings (Q2189630) (← links)
- A differentiable homotopy method to compute perfect equilibria (Q2220655) (← links)
- Hölder-type global error bounds for non-degenerate polynomial systems (Q2405036) (← links)
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates (Q2413090) (← links)
- Sufficient conditions for error bounds and linear regularity in Banach spaces (Q2452391) (← links)
- Weak sharp minima revisited. II: Application to linear regularity and error bounds (Q2576722) (← links)
- Error bounds for convex differentiable inequality systems in Banach spaces (Q2576731) (← links)
- Lifted stationary points of sparse optimization with complementarity constraints (Q2696930) (← links)
- Łojasiewicz-type inequalities and global error bounds for nonsmooth definable functions in o-minimal structures (Q2786583) (← links)
- Pareto Optimizing and Kuhn–Tucker Stationary Sequences (Q3444667) (← links)
- GLOBAL ERROR BOUNDS WITH EXPONENTS FOR MULTIFUNCTIONS WITH SET CONSTRAINTS (Q3577791) (← links)
- System error bounds for Lagrange polynomial estimation of band-limited functions (Corresp.) (Q4060850) (← links)
- Coercive polynomials: stability, order of growth, and Newton polytopes (Q4613988) (← links)
- Global error bounds for convex quadratic inequality systems<sup>*</sup> (Q4764592) (← links)
- Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
- Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming (Q5097021) (← links)
- Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints (Q5252585) (← links)
- (Q5706790) (← links)
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems (Q5741071) (← links)
- On the identification of the optimal partition for semidefinite optimization (Q5882391) (← links)
- Error bounds for the solution sets of generalized polynomial complementarity problems (Q5887660) (← links)
- Robust error bounds for uncertain convex inequality systems with applications (Q6116044) (← links)
- Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity (Q6176421) (← links)
- A variant of the logistic quantal response equilibrium to select a perfect equilibrium (Q6582422) (← links)
- Improved effective Łojasiewicz inequality and applications (Q6652253) (← links)
