Weak Sharp Minima in Mathematical Programming

DOI10.1137/0331063zbMath0791.90040OpenAlexW2064114733MaRDI QIDQ3141558

James V. Burke, Michael C. Ferris

Publication date: 13 July 1994

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/59530

zbMATH Keywords

linear complementarityweak sharp minimafinite terminationquadratic convex programmingstrongly unique minima

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

On a class of controlled differential variational inequalities, Optimality conditions for bilevel programming problems, On applications of the calmness moduli for multifunctions to error bounds, Inexact subgradient methods for quasi-convex optimization problems, Smoothing SQP algorithm for semismooth equations with box constraints, A Lipschitzian error bound for monotone symmetric cone linear complementarity problem, Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging, Optimality Conditions for Bilevel Programming: An Approach Through Variational Analysis, A proximal point algorithm for generalized fractional programs, On Hölder calmness of minimizing sets, Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces, Convergence of a proximal algorithm for solving the dual of a generalized fractional program, Unnamed Item, Prox-dual regularization algorithm for generalized fractional programs, Set regularities and feasibility problems, The equivalence of three types of error bounds for weakly and approximately convex functions, Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming, Nonsmooth rank-one matrix factorization landscape, Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints, Finite convergence of extragradient-type methods for solving variational inequalities under weak sharp condition, A low-rank spectral method for learning Markov models, Hölder Stable Minimizers, Tilt Stability, and Hölder metric Regularity of Subdifferentials, Fréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimization, Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Radial duality. II: Applications and algorithms, Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem, Ekeland's variational principle for interval-valued functions, Gâteaux differentiability of the dual gap function of a variational inequality, Optimal Convergence Rates for the Proximal Bundle Method, Error bounds and a condition number for the absolute value equations, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, Faster first-order primal-dual methods for linear programming using restarts and sharpness, Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification, Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity, Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications, General Hölder smooth convergence rates follow from specialized rates assuming growth bounds, A note on optimality conditions for bilevel programming problems^∗, Relax-and-split method for nonconvex inverse problems, Characterization of metric regularity for \({\sigma}\)-subsmooth multifunctions, Some results on (ρ, b, d)-variational inequalities, Value functions and error bounds of trust region methods, Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent, Convergence Analysis of Gradient Algorithms on Riemannian Manifolds without Curvature Constraints and Application to Riemannian Mass, Optimality conditions for the simple convex bilevel programming problem in Banach spaces, Weakly sharp solutions and finite convergence of algorithms for a variational inequality problem, A SUFFICIENT MINIMALITY CONDITION FOR CONVEX COMPOSITE FUNCTIONS, Unified nonlinear Lagrangian approach to duality and optimal paths, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, Global convergence and finite termination of a class of smooth penalty function algorithms, New necessary optimality conditions in optimistic bilevel programming, On Finite and Strong Convergence of a Proximal Method for Equilibrium Problems, About regularity of collections of sets, Generalized Metric Subregularity and Regularity with Respect to an Admissible Function, Double-regularization proximal methods, with complementarity applications, Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, An iterative method and weak sharp solutions for multitime-type variational inequalities, Error bound and well-posedness with respect to an admissible function, Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem, A note on finite termination of iterative algorithms in mathematical programming, Sharpness, Restart, and Acceleration, Isolated calmness of solution mappings in convex semi-infinite optimization, Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds, On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications, On Controlled Variational Inequalities Involving Convex Functionals, Characterizations of error bounds for lower semicontinuous functions on metric spaces, Nonconvex Robust Low-Rank Matrix Recovery, Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods, Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities, Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms, Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method, Lipschitz modulus in convex semi-infinite optimizationviad.c. functions, Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity, On the Solution of Stochastic Optimization and Variational Problems in Imperfect Information Regimes, On convergence of the proximal point algorithm in Banach spaces, Stability in convex semi-infinite programming and rates of convergence of optimal solutions of discretized finite subproblems, Finite termination of the proximal point method for convex functions on Hadamard manifolds, Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates, On the finite termination of the gradient projection method, Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods, Proximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite Termination, Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming, On finite convergence of proximal point algorithms for variational inequalities, Hoffman's least error bounds for systems of linear inequalities, Random minibatch subgradient algorithms for convex problems with functional constraints, Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints, Weak sharpness and finite termination for variational inequalities on Hadamard manifolds, Weak sharp minima revisited. II: Application to linear regularity and error bounds, Error bounds for eigenvalue and semidefinite matrix inequality systems, Hölder weak sharp minimizers and Hölder tilt-stability, On a class of variational-type inequalities involving curvilinear integral functionals, Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem, Convergence of Prox-Regularization Methods for Generalized Fractional Programming, Proximal Gradient Methods for Machine Learning and Imaging, Some Dual Conditions for Global Weak Sharp Minimality of Nonconvex Functions, Low rank matrix recovery with adversarial sparse noise*, Minimum and maximum principle sufficiency properties for nonsmooth variational inequalities, Characterization of weakly sharp solutions of a variational inequality by its primal gap function, Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems, Weak sharp solutions associated with a multidimensional variational-type inequality, Subgradient methods for sharp weakly convex functions, Quantitative stability in stochastic programming, Error bounds for inconsistent linear inequalities and programs, On the range sets of variational inequalities, Convergence of inexact quasisubgradient methods with extrapolation, A Lipschitzian error bound for convex quadratic symmetric cone programming, Weak sharp efficiency in multiobjective optimization, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems, Error bounds in mathematical programming, New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure, Continuities of metric projection and geometric consequences, A proximal point algorithm for minimax problems, A Gauss-Newton method for convex composite optimization, Equivalent properties of global weak sharp minima with applications, On finite termination of an inexact proximal point algorithm, Optimality conditions for weak \({\psi}\) -sharp minima in vector optimization problems, On a sufficient condition for weak sharp efficiency in multiobjective optimization, Weak sharp solutions for variational inequalities in Banach spaces, Linear conditioning, weak sharpness and finite convergence for equilibrium problems, From error bounds to the complexity of first-order descent methods for convex functions, Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization, New characterizations of weak sharp minima, Strong Fermat rules for constrained set-valued optimization problems on Banach spaces, Equivalent conditions for local error bounds, Weak sharp solutions for generalized variational inequalities, On finite convergence of iterative methods for variational inequalities in Hilbert spaces, Finite convergence analysis and weak sharp solutions for variational inequalities, On the variational behaviour of functions with positive steepest descent rate, Minimizing irregular convex functions: Ulam stability for approximate minima, Generalized weak sharp minima in cone-constrained convex optimization with applications, Characterizing the solution set of convex optimization problems without convexity of constraints, Global convergence of a class of smooth penalty methods for semi-infinite programming, Strong KKT conditions and weak sharp solutions in convex-composite optimization, Weak sharp minima in set-valued optimization problems, Necessary conditions for weak sharp minima in cone-constrained optimization problems, Weak sharp solutions for nonsmooth variational inequalities, Weak sharpness for gap functions in vector variational inequalities, A note on weak sharp minima in multicriteria linear programming, Random algorithms for convex minimization problems, Global error bounds for \(\gamma \)-paraconvex multifunctions, Weak \(\psi \)-sharp minima in vector optimization problems, Finite convergence of a projected proximal point algorithm for the generalized variational inequalities, The effect of deterministic noise in subgradient methods, Error bounds and finite termination for constrained optimization problems, The optimal value and optimal solutions of the proximal average of convex functions, Metric subregularity for proximal generalized equations in Hilbert spaces, Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity, Weak sharp minima for piecewise linear multiobjective optimization in normed spaces, Characterization of weakly sharp solutions of a variational-type inequality with convex functional, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017, Finite convergence of the proximal point algorithm for variational inequality problems, Finite termination of inexact proximal point algorithms in Hilbert spaces, Weak sharp solutions of mixed variational inequalities in Banach spaces, Characterization results of weak sharp solutions for split variational inequalities with application to traffic analysis, Lagrange multipliers, (exact) regularization and error bounds for monotone variational inequalities, The global weak sharp minima with explicit exponents in polynomial vector optimization problems, Global weak sharp minima for convex (semi-)infinite optimization problems, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty, About subtransversality of collections of sets, Slopes, error bounds and weak sharp Pareto minima of a vector-valued map, Strong Abadie CQ, ACQ, calmness and linear regularity, Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions, Error bounds for systems of lower semicontinuous functions in Asplund spaces, Metric subregularity for composite-convex generalized equations in Banach spaces, Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems, Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs, Weak sharp minima for set-valued vector variational inequalities with an application, Error bounds: necessary and sufficient conditions, Convergence properties of nonmonotone spectral projected gradient methods, Second-order global optimality conditions for optimization problems, Subsmooth semi-infinite and infinite optimization problems, Minimum and maximum principle sufficiency for a nonsmooth variational inequality, Nonconvex weak sharp minima on Riemannian manifolds, On error bound moduli for locally Lipschitz and regular functions, On a class of constrained interval-valued optimization problems governed by mechanical work cost functionals, General convergence analysis of stochastic first-order methods for composite optimization, Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities, Weak sharpness and finite convergence for solutions of nonsmooth variational inequalities in Hilbert spaces, A proximal point-type method for multicriteria optimization, Constrained Lipschitzian error bounds and noncritical solutions of constrained equations, Faster subgradient methods for functions with Hölderian growth, New uniform parametric error bounds, Conditional subgradient optimization -- theory and applications, Two error bounds for constrained optimization problems and their applications, Error stability properties of generalized gradient-type algorithms, On weak sharp solutions in \((\rho , \mathbf{b}, \mathbf{d})\)-variational inequalities, Strict directional solutions in vectorial problems: necessary optimality conditions, Moduli of regularity and rates of convergence for Fejér monotone sequences, Some aspects of nonsmooth variational inequalities on Hadamard manifolds, Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems, On the resolution of misspecified convex optimization and monotone variational inequality problems, Convergence rates of subgradient methods for quasi-convex optimization problems, Characterizations of strict local minima and necessary conditions for weak sharp minima