Pages that link to "Item:Q3141558"

The following pages link to Weak Sharp Minima in Mathematical Programming (Q3141558):

Displaying 50 items.

• A proximal point algorithm for minimax problems (Q1371666) (← links)
• Subgradient methods for sharp weakly convex functions (Q1626538) (← links)
• New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
• On a sufficient condition for weak sharp efficiency in multiobjective optimization (Q1670009) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• Weak sharp solutions for generalized variational inequalities (Q1683251) (← links)
• Finite convergence analysis and weak sharp solutions for variational inequalities (Q1686554) (← links)
• Weak sharp solutions for nonsmooth variational inequalities (Q1695815) (← links)
• Error bounds and finite termination for constrained optimization problems (Q1717787) (← links)
• Characterization of weakly sharp solutions of a variational-type inequality with convex functional (Q1730455) (← links)
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
• Weak sharp solutions of mixed variational inequalities in Banach spaces (Q1744625) (← 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)
• Second-order global optimality conditions for optimization problems (Q1777438) (← links)
• On error bound moduli for locally Lipschitz and regular functions (Q1785207) (← links)
• Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
• A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
• New characterizations of weak sharp minima (Q1926622) (← links)
• Strong Fermat rules for constrained set-valued optimization problems on Banach spaces (Q1928759) (← links)
• Equivalent conditions for local error bounds (Q1928763) (← links)
• Generalized weak sharp minima in cone-constrained convex optimization with applications (Q1935574) (← links)
• Global convergence of a class of smooth penalty methods for semi-infinite programming (Q1937778) (← links)
• Weak sharp minima in set-valued optimization problems (Q1938341) (← links)
• Weak \(\psi \)-sharp minima in vector optimization problems (Q1958016) (← links)
• The effect of deterministic noise in subgradient methods (Q1960191) (← links)
• Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems (Q2007835) (← links)
• Minimum and maximum principle sufficiency for a nonsmooth variational inequality (Q2021583) (← links)
• On a class of constrained interval-valued optimization problems governed by mechanical work cost functionals (Q2031946) (← links)
• General convergence analysis of stochastic first-order methods for composite optimization (Q2032020) (← links)
• Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
• Weak sharpness and finite convergence for solutions of nonsmooth variational inequalities in Hilbert spaces (Q2045138) (← links)
• Constrained Lipschitzian error bounds and noncritical solutions of constrained equations (Q2047264) (← links)
• On weak sharp solutions in \((\rho , \mathbf{b}, \mathbf{d})\)-variational inequalities (Q2069328) (← links)
• Strict directional solutions in vectorial problems: necessary optimality conditions (Q2070365) (← links)
• Some aspects of nonsmooth variational inequalities on Hadamard manifolds (Q2073011) (← links)
• Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
• Convergence of inexact quasisubgradient methods with extrapolation (Q2139278) (← links)
• Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems (Q2156706) (← links)
• On finite termination of an inexact proximal point algorithm (Q2171164) (← links)
• Linear conditioning, weak sharpness and finite convergence for equilibrium problems (Q2176285) (← links)
• Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) (← links)
• Characterization results of weak sharp solutions for split variational inequalities with application to traffic analysis (Q2241140) (← 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)
• Nonconvex weak sharp minima on Riemannian manifolds (Q2275271) (← 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)