Pages that link to "Item:Q3141558"

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

Displaying 50 items.

• Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
• Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
• Hölder weak sharp minimizers and Hölder tilt-stability (Q2349020) (← links)
• Smoothing SQP algorithm for semismooth equations with box constraints (Q2376126) (← links)
• Prox-dual regularization algorithm for generalized fractional programs (Q2411175) (← links)
• Set regularities and feasibility problems (Q2413089) (← links)
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
• Gâteaux differentiability of the dual gap function of a variational inequality (Q2427179) (← links)
• Characterization of metric regularity for \({\sigma}\)-subsmooth multifunctions (Q2442741) (← links)
• Value functions and error bounds of trust region methods (Q2454979) (← links)
• Unified nonlinear Lagrangian approach to duality and optimal paths (Q2465457) (← links)
• About regularity of collections of sets (Q2501521) (← links)
• Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
• A note on finite termination of iterative algorithms in mathematical programming (Q2517801) (← links)
• Isolated calmness of solution mappings in convex semi-infinite optimization (Q2518772) (← links)
• On finite convergence of proximal point algorithms for variational inequalities (Q2573440) (← links)
• Hoffman's least error bounds for systems of linear inequalities (Q2574102) (← links)
• Weak sharp minima revisited. II: Application to linear regularity and error bounds (Q2576722) (← links)
• Error bounds for eigenvalue and semidefinite matrix inequality systems (Q2576734) (← links)
• Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
• The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
• Nonsmooth rank-one matrix factorization landscape (Q2673521) (← links)
• Finite convergence of extragradient-type methods for solving variational inequalities under weak sharp condition (Q2678822) (← links)
• A low-rank spectral method for learning Markov models (Q2679005) (← links)
• Ekeland's variational principle for interval-valued functions (Q2685291) (← links)
• Error bounds and a condition number for the absolute value equations (Q2687040) (← links)
• Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry (Q2687067) (← links)
• Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
• General Hölder smooth convergence rates follow from specialized rates assuming growth bounds (Q2696991) (← links)
• Generalized metric subregularity and regularity with respect to an admissible function (Q2789612) (← links)
• Error bound and well-posedness with respect to an admissible function (Q2805627) (← links)
• Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem (Q2805759) (← links)
• Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds (Q2808303) (← links)
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications (Q2810547) (← links)
• Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms (Q2817234) (← links)
• On the solution of stochastic optimization and variational problems in imperfect information regimes (Q2832894) (← links)
• Some Dual Conditions for Global Weak Sharp Minimality of Nonconvex Functions (Q2877752) (← links)
• Hölder Stable Minimizers, Tilt Stability, and Hölder metric Regularity of Subdifferentials (Q2954388) (← links)
• Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming (Q2956394) (← links)
• Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming (Q3066922) (← links)
• On convergence of the proximal point algorithm in Banach spaces (Q3103282) (← links)
• Convergence of Prox-Regularization Methods for Generalized Fractional Programming (Q3148378) (← links)
• Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging (Q3188209) (← links)
• Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming (Q3426240) (← links)
• A Lipschitzian error bound for monotone symmetric cone linear complementarity problem (Q3453409) (← links)
• Lipschitz modulus in convex semi-infinite optimization<i>via</i>d.c. functions (Q3643500) (← links)
• A note on optimality conditions for bilevel programming problems^∗ (Q4340163) (← links)
• Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis (Q4430668) (← links)
• Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems (Q4470657) (← links)