Pages that link to "Item:Q1365060"

The following pages link to Error bounds in mathematical programming (Q1365060):

Displaying 50 items.

• Sharp minima for multiobjective optimization in Banach spaces (Q858169) (← links)
• Error bounds for initial value problems by optimization (Q889871) (← links)
• On estimates for solutions of systems of convex inequalities (Q901843) (← links)
• Error bounds and Hölder metric subregularity (Q904312) (← links)
• Weak sharp minima for piecewise linear multiobjective optimization in normed spaces (Q927945) (← links)
• Inexact operator splitting methods with selfadaptive strategy for variational inequality problems (Q933805) (← links)
• An augmented Lagrangian approach with a variable transformation in nonlinear programming (Q944771) (← links)
• Global weak sharp minima for convex (semi-)infinite optimization problems (Q950495) (← links)
• Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions (Q959926) (← links)
• Condition numbers and error bounds in convex programming (Q959930) (← links)
• Error bounds for systems of lower semicontinuous functions in Asplund spaces (Q959949) (← links)
• Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets (Q975841) (← links)
• Weak sharp minima for set-valued vector variational inequalities with an application (Q976439) (← links)
• Error bounds: necessary and sufficient conditions (Q977075) (← links)
• Image space analysis for vector variational inequalities with matrix inequality constraints and applications (Q983716) (← links)
• Vector variational inequalities involving set-valued mappings via scalarization with applications to error bounds for gap functions (Q987510) (← links)
• Levitin-Polyak well-posedness of constrained vector optimization problems (Q995942) (← links)
• An operator splitting method for variational inequalities with partially unknown mappings (Q998631) (← links)
• Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities (Q1012237) (← links)
• Components identification based method for box constrained variational inequality problems with almost linear functions (Q1014895) (← links)
• An algorithm for generalized variational inequality with pseudomonotone mapping (Q1019789) (← links)
• Global error bound for the generalized linear complementarity problem over a polyhedral cone (Q1035916) (← links)
• Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints (Q1407235) (← links)
• Merit functions and error bounds for generalized variational inequalities. (Q1417974) (← links)
• Error bounds in mathematical programming. Special issue (Q1584000) (← links)
• Solving a class of asymmetric variational inequalities by a new alternating direction method (Q1591954) (← links)
• Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems (Q1594871) (← links)
• Error bounds for the solution sets of quadratic complementarity problems (Q1626539) (← links)
• Analysis of classifiers' robustness to adversarial perturbations (Q1640392) (← links)
• A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem (Q1646189) (← links)
• Approximations and solution estimates in optimization (Q1659679) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• An improvement of global error bound for the generalized nonlinear complementarity problem over a polyhedral cone (Q1724478) (← links)
• Error bound for conic inequality in Hilbert spaces (Q1724962) (← links)
• Error bounds for affine variational inequalities with second-order cone constraints (Q1728307) (← links)
• On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems (Q1732230) (← links)
• Quantitative stability analysis of stochastic mathematical programs with vertical complementarity constraints (Q1735706) (← links)
• A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property (Q1739040) (← links)
• The global weak sharp minima with explicit exponents in polynomial vector optimization problems (Q1746026) (← links)
• Slopes, error bounds and weak sharp Pareto minima of a vector-valued map (Q1752645) (← links)
• Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
• Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity (Q1782218) (← links)
• Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems (Q1785203) (← links)
• On error bound moduli for locally Lipschitz and regular functions (Q1785207) (← links)
• Error bounds for rank constrained optimization problems and applications (Q1790190) (← links)
• Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities (Q1887951) (← links)
• The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
• New characterizations of weak sharp minima (Q1926622) (← links)
• Coderivative conditions for error bounds of \(\gamma\)-paraconvex multifunctions (Q1928758) (← links)