Pages that link to "Item:Q3141558"

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

Displaying 50 items.

• Optimality Conditions for Bilevel Programming: An Approach Through Variational Analysis (Q4557873) (← links)
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
• A proximal point algorithm for generalized fractional programs (Q4559394) (← links)
• Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces (Q4577185) (← links)
• Convergence of a proximal algorithm for solving the dual of a generalized fractional program (Q4578155) (← links)
• Optimality conditions for the simple convex bilevel programming problem in Banach spaces (Q4639128) (← links)
• Weakly sharp solutions and finite convergence of algorithms for a variational inequality problem (Q4639132) (← links)
• A SUFFICIENT MINIMALITY CONDITION FOR CONVEX COMPOSITE FUNCTIONS (Q4639834) (← links)
• Optimality conditions for bilevel programming problems (Q4836753) (← links)
• Global convergence and finite termination of a class of smooth penalty function algorithms (Q4924100) (← links)
• An iterative method and weak sharp solutions for multitime-type variational inequalities (Q4958376) (← links)
• Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods (Q5003207) (← links)
• Weak sharpness and finite termination for variational inequalities on Hadamard manifolds (Q5009154) (← links)
• Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
• Low rank matrix recovery with adversarial sparse noise* (Q5030160) (← links)
• On a class of controlled differential variational inequalities (Q5038083) (← links)
• On applications of the calmness moduli for multifunctions to error bounds (Q5045174) (← links)
• On Hölder calmness of minimizing sets (Q5077164) (← links)
• Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming (Q5097021) (← links)
• Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
• Some results on (ρ, b, d)-variational inequalities (Q5141734) (← links)
• Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent (Q5143310) (← links)
• Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass (Q5148408) (← links)
• Sharpness, Restart, and Acceleration (Q5210521) (← links)
• On Controlled Variational Inequalities Involving Convex Functionals (Q5214419) (← links)
• Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)
• Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities (Q5219716) (← links)
• Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity (Q5231668) (← links)
• (Q5237026) (← links)
• Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
• On the finite termination of the gradient projection method (Q5244128) (← links)
• New necessary optimality conditions in optimistic bilevel programming (Q5426961) (← links)
• On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems (Q5438285) (← links)
• Characterizations of error bounds for lower semicontinuous functions on metric spaces (Q5465558) (← links)
• Finite termination of the proximal point method for convex functions on Hadamard manifolds (Q5495590) (← links)
• Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination (Q5506691) (← links)
• On a class of variational-type inequalities involving curvilinear integral functionals (Q5870149) (← links)
• Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
• Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints (Q6038637) (← links)
• Fréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimization (Q6085819) (← links)
• Radial duality. II: Applications and algorithms (Q6126645) (← links)
• Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem (Q6141535) (← links)
• Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)
• Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
• Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity (Q6176421) (← links)
• The level-set subdifferential error bound via Moreau envelopes (Q6561484) (← links)
• Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective (Q6568925) (← links)
• Finite termination of the optimal solution sequence in parametric optimization (Q6570160) (← links)