The following pages link to (Q5478968):
Displaying 50 items.
- A Lipschitzian error bound for convex quadratic symmetric cone programming (Q312538) (← links)
- Weak sharp efficiency in multiobjective optimization (Q315498) (← links)
- Optimality conditions for weak \({\psi}\) -sharp minima in vector optimization problems (Q369636) (← links)
- Necessary conditions for weak sharp minima in cone-constrained optimization problems (Q417222) (← links)
- Minimum recession-compatible subsets of closed convex sets (Q421277) (← links)
- Finite convergence of the proximal point algorithm for variational inequality problems (Q491230) (← links)
- Finite termination of inexact proximal point algorithms in Hilbert spaces (Q493258) (← links)
- Metric subregularity for composite-convex generalized equations in Banach spaces (Q534471) (← links)
- Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization (Q607890) (← links)
- Strong KKT conditions and weak sharp solutions in convex-composite optimization (Q623359) (← links)
- Global error bounds for \(\gamma \)-paraconvex multifunctions (Q645069) (← links)
- Metric subregularity for proximal generalized equations in Hilbert spaces (Q654110) (← links)
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity (Q654111) (← links)
- Finite termination of the proximal point algorithm in Banach spaces (Q655479) (← links)
- About subtransversality of collections of sets (Q683294) (← links)
- Subsmooth semi-infinite and infinite optimization problems (Q715070) (← links)
- Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
- Sharp minima for multiobjective optimization in Banach spaces (Q858169) (← links)
- On the variational behaviour of functions with positive steepest descent rate (Q891928) (← links)
- Level sets relaxation, epigraphical relaxation and conditioning in optimization (Q891933) (← 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)
- Error bounds for systems of lower semicontinuous functions in Asplund spaces (Q959949) (← links)
- Weak sharp minima for set-valued vector variational inequalities with an application (Q976439) (← links)
- Error bounds: necessary and sufficient conditions (Q977075) (← links)
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
- Slopes, error bounds and weak sharp Pareto minima of a vector-valued map (Q1752645) (← links)
- New characterizations of weak sharp minima (Q1926622) (← links)
- Strong Fermat rules for constrained set-valued optimization problems on Banach spaces (Q1928759) (← links)
- Generalized weak sharp minima in cone-constrained convex optimization with applications (Q1935574) (← links)
- Weak sharp minima in set-valued optimization problems (Q1938341) (← links)
- Global error bounds for piecewise convex polynomials (Q1942267) (← links)
- Weak \(\psi \)-sharp minima in vector optimization problems (Q1958016) (← links)
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method (Q2046546) (← links)
- Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories (Q2047201) (← links)
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems (Q2156706) (← links)
- Characterizations of stability of error bounds for convex inequality constraint systems (Q2165598) (← links)
- Linear conditioning, weak sharpness and finite convergence for equilibrium problems (Q2176285) (← links)
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty (Q2244235) (← links)
- Strong Abadie CQ, ACQ, calmness and linear regularity (Q2248746) (← links)
- Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM (Q2279378) (← links)
- Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
- Moduli of regularity and rates of convergence for Fejér monotone sequences (Q2317680) (← links)
- Set regularities and feasibility problems (Q2413089) (← links)
- Sufficient conditions for error bounds and linear regularity in Banach spaces (Q2452391) (← links)
- About regularity of collections of sets (Q2501521) (← links)
- A note on finite termination of iterative algorithms in mathematical programming (Q2517801) (← links)
- Weak sharp minima revisited. II: Application to linear regularity and error bounds (Q2576722) (← links)
- Calmness of constraint systems with applications (Q2576730) (← links)
- The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
