Error bounds in mathematical programming

From MaRDI portal

Publication:1365060

Jump to:navigation, search

DOI10.1007/BF02614322zbMath0887.90165OpenAlexW2082451773WikidataQ105583445 ScholiaQ105583445MaRDI QIDQ1365060

Jong-Shi Pang

Publication date: 25 May 1998

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02614322

zbMATH Keywords

error bounds penalty function inequality systems

Mathematics Subject Classification ID

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

Related Items

Nonlinear error bounds for quasiconvex inequality systems, Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems, A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems, On applications of the calmness moduli for multifunctions to error bounds, Superlinearly convergent trust-region method without the assumption of positive-definite Hessian, Inexact subgradient methods for quasi-convex optimization problems, A Lipschitzian error bound for monotone symmetric cone linear complementarity problem, Error bounds revisited, On Hölder calmness of minimizing sets, Improved error bound and a hybrid method for generalized Nash equilibrium problems, Characterizations of stability of error bounds for convex inequality constraint systems, Hölder-type global error bounds for non-degenerate polynomial systems, A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure, FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming, Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee, Confidence regions of stochastic variational inequalities: error bound approach, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates, Perturbation of error bounds, Exact Penalization of Generalized Nash Equilibrium Problems, The equivalence of three types of error bounds for weakly and approximately convex functions, Equivalent conditions for local error bounds, Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, Error bounds for monomial convexification in polynomial optimization, Time-distributed optimization for real-time model predictive control: stability, robustness, and constraint satisfaction, Bounds on the objective value of feasible roundings, Second-order strong Karush/Kuhn-Tucker conditions for proper efficiencies in multiobjective optimization, A low-rank spectral method for learning Markov models, Stability of error bounds for conic subsmooth inequalities, Error bound results for convex inequality systems via conjugate duality, Global error bounds for piecewise convex polynomials, Error bounds and a condition number for the absolute value equations, Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications, On set-valued complementarity problems, A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems, Golden ratio algorithms for variational inequalities, The solution set characterization and error bound for the extended mixed linear complementarity problem, Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems, The effect of deterministic noise in subgradient methods, Linear and nonlinear error bounds for lower semicontinuous functions, An improved two-step method for generalized variational inequalities, Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance, Solving quasi-variational inequalities via their KKT conditions, Sufficient conditions for error bounds and linear regularity in Banach spaces, Amenable cones: error bounds without constraint qualifications, DirectionalK-epiderivatives and error bound, A class of projection and contraction methods for asymmetric linear variational inequalities and their relations to Fukushima's descent method, Global bounds for the distance to solutions of co-coercive variational inequalities, Unnamed Item, Global bounds for cocoercive variational inequalities, Calmness of the argmin mapping in linear semi-infinite optimization, Error estimation in nonlinear optimization, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, Vector quasi-equilibrium problems: separation, saddle points and error bounds for the solution set, A new notion of error bounds: necessary and sufficient conditions, Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems, Computation of error bounds for P-matrix linear complementarity problems, New characterizations of Hoffman constants for systems of linear constraints, Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization, Acceptable solutions and backward errors for tensor complementarity problems, Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM, Nonconvex robust programming via value-function optimization, On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes, A smoothing Levenberg-Marquardt method for NCP, A generalized Hellinger distance for Choquet integral, Multidirectional Mean Value Inequalities in Quasidifferential Calculus, Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem, Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem, On the quantitative solution stability of parameterized set-valued inclusions, A unifying theory of exactness of linear penalty functions, A nonmonotone smoothing Newton algorithm for weighted complementarity problem, Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method, On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications, Constrained Lipschitzian error bounds and noncritical solutions of constrained equations, Faster subgradient methods for functions with Hölderian growth, Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions, Merit functions and error bounds for constrained mixed set-valued variational inequalities via generalizedf-projection operators, Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity, On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system, Error bounds and metric subregularity, Some characterizations of error bound for non-lower semicontinuous functions, Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces, Quasi-convex feasibility problems: subgradient methods and convergence rates, A versatile approach to metric regularity, openness, and Lipschitzian properties, A new double projection algorithm for variational inequalities, An improvement on the global error bound estimation for ELCP and its applications, Hoffman's least error bounds for systems of linear inequalities, Weak sharp minima revisited. II: Application to linear regularity and error bounds, Calmness of constraint systems with applications, Error bounds for convex differentiable inequality systems in Banach spaces, Error bounds for eigenvalue and semidefinite matrix inequality systems, On calmness of the argmin mapping in parametric optimization problems, A smoothing Levenberg-Marquardt algorithm for semi-infinite programming, First-Order Algorithms for a Class of Fractional Optimization Problems, On a primal-dual Newton proximal method for convex quadratic programs, Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces, On error bounds for systems, An infeasible projection type algorithm for nonmonotone variational inequalities, Some recent advances in projection-type methods for variational inequalities, New global error bound for extended linear complementarity problems, Higher-order error bound for the difference of two functions, Error bounds for the solution sets of quadratic complementarity problems, Error bounds for complementarity problems with tridiagonal nonlinear functions, Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities, Optimality functions and lopsided convergence, Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, Exact penalty results for mathematical programs with vanishing constraints, A Lipschitzian error bound for convex quadratic symmetric cone programming, Error bounds for mixed integer nonlinear optimization problems, Analysis of classifiers' robustness to adversarial perturbations, Gap functions and global error bounds for set-valued variational inequalities, A stable primal-dual approach for linear programming under nondegeneracy assumptions, A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem, Sharp minima for multiobjective optimization in Banach spaces, Approximations and solution estimates in optimization, Second-order analysis of penalty function, From error bounds to the complexity of first-order descent methods for convex functions, Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone, The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets, New characterizations of weak sharp minima, Coderivative conditions for error bounds of \(\gamma\)-paraconvex multifunctions, Strong Fermat rules for constrained set-valued optimization problems on Banach spaces, On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers, Stability analysis of one stage stochastic mathematical programs with complementarity constraints, Error analysis of approximate solutions to parametric vector quasiequilibrium problems, Minimum recession-compatible subsets of closed convex sets, On estimates for solutions of systems of convex inequalities, Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria, Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints, Error bounds and Hölder metric subregularity, Exact penalty and error bounds in DC programming, Asymptotical good behavior on inequalities with completely approximate K-T concept, Error bounds for nonlinear complementarity problems with band structure, A projection-proximal point algorithm for solving generalized variational inequalities, Weak sharpness for gap functions in vector variational inequalities, A note on weak sharp minima in multicriteria linear programming, Global error bound estimation for the generalized nonlinear complementarity problem over a closed convex cone, Merit functions and error bounds for generalized variational inequalities., Global error bounds for \(\gamma \)-paraconvex multifunctions, Error bounds for vector-valued functions: necessary and sufficient conditions, An improvement of global error bound for the generalized nonlinear complementarity problem over a polyhedral cone, Error bound for conic inequality in Hilbert spaces, Weak sharp minima for piecewise linear multiobjective optimization in normed spaces, Error bounds for affine variational inequalities with second-order cone constraints, Inexact operator splitting methods with selfadaptive strategy for variational inequality problems, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, Error bound for conic inequality, Quantitative stability analysis of stochastic mathematical programs with vertical complementarity constraints, A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems, A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property, An augmented Lagrangian approach with a variable transformation in nonlinear programming, Nonlinear metric subregularity, The global weak sharp minima with explicit exponents in polynomial vector optimization problems, Global weak sharp minima for convex (semi-)infinite optimization problems, A nonmonotone Levenberg-Marquardt method for nonlinear complementarity problems under local error bound, Slopes, error bounds and weak sharp Pareto minima of a vector-valued map, Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions, Condition numbers and error bounds in convex programming, Error bounds for systems of lower semicontinuous functions in Asplund spaces, A subgradient extragradient algorithm for solving multi-valued variational inequality, Hölder continuity and upper estimates of solutions to vector quasiequilibrium problems, Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound, Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs, Optimization problems with equilibrium constraints and their numerical solution., On the existence of solutions to stochastic mathematical programs with equilibrium constraints, Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets, A double projection algorithm for multi-valued variational inequalities and a unified framework of the method, Weak sharp minima for set-valued vector variational inequalities with an application, Extended duality for nonlinear programming, Error bounds: necessary and sufficient conditions, Image space analysis for vector variational inequalities with matrix inequality constraints and applications, Subsmooth semi-infinite and infinite optimization problems, A relaxed constant positive linear dependence constraint qualification and applications, Vector variational inequalities involving set-valued mappings via scalarization with applications to error bounds for gap functions, Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity, A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions, Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems, On error bound moduli for locally Lipschitz and regular functions, Error bounds via exact penalization with applications to concave and quadratic systems, Levitin-Polyak well-posedness of constrained vector optimization problems, Error bounds for rank constrained optimization problems and applications, An operator splitting method for variational inequalities with partially unknown mappings, Error bounds for the difference of two convex multifunctions, A new error bound result for generalized Nash equilibrium problems and its algorithmic application, On error bounds and Newton-type methods for generalized Nash equilibrium problems, A regularized Newton method without line search for unconstrained optimization, Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities, Components identification based method for box constrained variational inequality problems with almost linear functions, New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors, An algorithm for generalized variational inequality with pseudomonotone mapping, Computation of generalized differentials in nonlinear complementarity problems, New exact penalty function for solving constrained finite min-max problems, Global error bound for the generalized linear complementarity problem over a polyhedral cone, Error bounds in mathematical programming. Special issue, Solving a class of asymmetric variational inequalities by a new alternating direction method, Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems, Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems, Active-set prediction for interior point methods using controlled perturbations, On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods, A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods, Error bounds for the solution sets of generalized polynomial complementarity problems, Unnamed Item, Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints, Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso, Exact computation of an error bound for the balanced linear complementarity problem with unique solution, Error bounds, facial residual functions and applications to the exponential cone, Quasi-error bounds for \(p\)-convex set-valued mappings, Nonlocal error bounds for piecewise affine functions, Confidence regions of two‐stage stochastic linear complementarity problems, Robust error bounds for uncertain convex inequality systems with applications, Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems, Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem, Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques, Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints, A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations, Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property, On continuous selections of polynomial functions, Unnamed Item, Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts, Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems., Distributionally Robust Reward-Risk Ratio Optimization with Moment Constraints, A regularized projection method for complementarity problems with non-Lipschitzian functions, Minimizing and stationary sequences of convex constrained minimization problems, Global projection-type error bounds for general variational inequalities, Bounded perturbation resilience of projected scaled gradient methods, Lower-order penalty methods for mathematical programs with complementarity constraints, Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities, A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution, Stability and Error Analysis for Optimization and Generalized Equations, Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints, Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems, A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization, Amenable Cones Are Particularly Nice, Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem, Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization, Slater Condition for Tangent Derivatives

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1365060&oldid=13509277"