On the public citation graph
Error bounds in mathematical programming
0 signed · 564 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/mana.19921570108openalex-snapshot
The Distance to the Intersection of Two Convex Sets Expressed by the Distances to Each of Them
inferredcites →https://doi.org/10.1007/978-1-4613-3341-8_3openalex-snapshot
Error Bounds for Convex Inequality Systems
inferredcites →https://doi.org/10.1007/978-1-4899-0289-4_11openalex-snapshot
Merit Functions for Variational Inequality and Complementarity Problems
inferredcites →https://doi.org/10.1007/bf00247654openalex-snapshot
An inexact NE/SQP method for solving the nonlinear complementarity problem
inferredcites →https://doi.org/10.1007/bf00938588openalex-snapshot
Stability and regular points of inequality systems
inferredcites →https://doi.org/10.1007/bf00939948openalex-snapshot
On the convergence of the coordinate descent method for convex differentiable minimization
inferredcites →https://doi.org/10.1007/bf01182979openalex-snapshot
Convergence of stationary sequences for variational inequalities with maximal monotone operators
inferredcites →https://doi.org/10.1007/bf01189901openalex-snapshot
Exact barrier function methods for Lipschitz programs
inferredcites →https://doi.org/10.1007/bf01300971openalex-snapshot
Local convergence of interior-point algorithms for degenerate monotone LCP
inferredcites →https://doi.org/10.1007/bf01580617openalex-snapshot
NE/SQP: A robust algorithm for the nonlinear complementarity problem
inferredcites →https://doi.org/10.1007/bf01580904openalex-snapshot
On the convergence of the affine-scaling algorithm
inferredcites →https://doi.org/10.1007/bf01581148openalex-snapshot
New improved error bounds for the linear complementarity problem
inferredcites →https://doi.org/10.1007/bf01581276openalex-snapshot
A globally convergent Newton method for solving strongly monotone variational inequalities
inferredcites →https://doi.org/10.1007/bf01582210openalex-snapshot
Error bounds for analytic systems and their applications
inferredcites →https://doi.org/10.1007/bf01582230openalex-snapshot
Sensitivity theorems in integer linear programming
inferredcites →https://doi.org/10.1007/bf01582255openalex-snapshot
Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
inferredcites →https://doi.org/10.1007/bf01582267openalex-snapshot
Error bounds for nondegenerate monotone linear complementarity problems
inferredcites →https://doi.org/10.1007/bf01585171openalex-snapshot
Nonlinear complementarity as unconstrained and constrained minimization
inferredcites →https://doi.org/10.1007/bf01585696openalex-snapshot
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
inferredcites →https://doi.org/10.1007/bf01594944openalex-snapshot
Finite termination of the proximal point algorithm
inferredcites →https://doi.org/10.1007/bf02023101openalex-snapshot
Error bounds and strong upper semicontinuity for monotone affine variational inequalities
inferredcites →https://doi.org/10.1007/bf02096261openalex-snapshot
Error bounds and convergence analysis of feasible descent methods: a general approach
inferredcites →https://doi.org/10.1007/bf02186474openalex-snapshot
Two-stage parallel iterative methods for the symmetric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf02189797openalex-snapshot
Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
inferredcites →https://doi.org/10.1007/bf02589517openalex-snapshot
On the division of distributions by polynomials
inferredcites →https://doi.org/10.1007/bf02591989openalex-snapshot
Inexact Newton methods for the nonlinear complementarity problem
inferredcites →https://doi.org/10.1007/bf02591991openalex-snapshot
Error bounds for monotone linear complementarity problems
inferredcites →https://doi.org/10.1007/bf02592146openalex-snapshot
LipschitzianQ-matrices areP-matrices
inferredcites →https://doi.org/10.1007/bf02592199openalex-snapshot
On the Lipschitzian properties of polyhedral multifunctions
inferredcites →https://doi.org/10.1007/bf02592200openalex-snapshot
On finite termination of an iterative method for linear complementarity problems
inferredcites →https://doi.org/10.1007/bf02592205openalex-snapshot
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
inferredcites →https://doi.org/10.1007/bf02614360openalex-snapshot
Equivalence of variational inequality problems to unconstrained minimization
inferredcites →https://doi.org/10.1007/bf02680557openalex-snapshot
Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
inferredcites →https://doi.org/10.1007/bfb0120929openalex-snapshot
Some continuity properties of polyhedral multifunctions
inferredcites →https://doi.org/10.1007/bfb0120965openalex-snapshot
Projection methods for variational inequalities with application to the traffic assignment problem
inferredcites →https://doi.org/10.1007/springerreference_5340openalex-snapshot
Complementarity problems
inferredcites →https://doi.org/10.1016/0022-247x(88)90034-0openalex-snapshot
Verifiable necessary and sufficient conditions for openness and regularity of set-valued and single-valued maps
inferredcites →https://doi.org/10.1016/0024-3795(90)90058-kopenalex-snapshot
Error bounds for the linear complementarity problem with a P-matrix
inferredcites →https://doi.org/10.1016/0024-3795(92)90049-gopenalex-snapshot
Global error bounds for monotone affine variational inequality problems
inferredcites →https://doi.org/10.1016/0024-3795(92)90174-9openalex-snapshot
The distance to a polyhedron
inferredcites →https://doi.org/10.1016/0024-3795(93)90125-8openalex-snapshot
The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
inferredcites →https://doi.org/10.1016/0024-3795(93)90344-nopenalex-snapshot
A new proof of Robinson's homeomorphism theorem for pl-normal maps
inferredcites →https://doi.org/10.1016/0024-3795(95)00707-5openalex-snapshot
On a global projection-type error bound for the linear complementarity problem
inferredcites →https://doi.org/10.1016/0167-6377(82)90049-9openalex-snapshot
The gap function of a convex program
inferredcites →https://doi.org/10.1016/0167-6377(94)90076-0openalex-snapshot
Error bounds for inconsistent linear inequalities and programs
inferredcites →https://doi.org/10.1016/0362-546x(89)90083-7openalex-snapshot
Metric regularity, openness and Lipschitzian behavior of multifunctions
inferredcites →https://doi.org/10.1016/0377-0427(94)00094-hopenalex-snapshot
On linear convergence of iterative methods for the variational inequality problem
inferredcites →https://doi.org/10.1016/b978-044488002-4/50024-5openalex-snapshot
10.1016/b978-044488002-4/50024-5
inferredcites →https://doi.org/10.1016/b978-1-898563-21-1.50008-0openalex-snapshot
Mathematical Programming
inferredcites →https://doi.org/10.1016/s0294-1449(17)30017-3openalex-snapshot
Well Behaved Asymptotical Convex Functions
inferredcites →https://doi.org/10.1017/cbo9780511983658openalex-snapshot
Mathematical Programs with Equilibrium Constraints
inferredcites →https://doi.org/10.1023/a:1022659603268openalex-snapshot
New NCP-Functions and Their Properties
inferredcites →https://doi.org/10.1023/a:1022660704427openalex-snapshot
Unconstrained Optimization Reformulations of Variational Inequality Problems
inferredcites →https://doi.org/10.1080/00029890.1989.11972271openalex-snapshot
An Optimization Problem
inferredcites →https://doi.org/10.1080/01630568908816335openalex-snapshot
Variational principles for variational inequalities
inferredcites →https://doi.org/10.1080/02331939208843795openalex-snapshot
A special newton-type optimization method
inferredcites →https://doi.org/10.1080/02331939208843840openalex-snapshot
Penalty functions in subanalytic optimization
inferredcites →https://doi.org/10.1080/02331939408844003openalex-snapshot
Global error bounds for convex quadratic inequality systems *
inferredcites →https://doi.org/10.1080/02331939508844053openalex-snapshot
Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993
inferredcites →https://doi.org/10.1080/10556789508805622openalex-snapshot
An estimate of solution setperturabations for a system of linear inequalities
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0246200-8openalex-snapshot
A Lipschitzian Characterization of Convex Polyhedra
inferredcites →https://doi.org/10.1090/s0002-9947-1993-1156300-4openalex-snapshot
Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
inferredcites →https://doi.org/10.1109/9.284908openalex-snapshot
On the rate of convergence of a distributed asynchronous routing algorithm
inferredcites →https://doi.org/10.1137/0313015openalex-snapshot
An Application of Error Bounds for Convex Programming in a Linear Space
inferredcites →https://doi.org/10.1137/0314020openalex-snapshot
Combined Primal–Dual and Penalty Methods for Convex Programming
inferredcites →https://doi.org/10.1137/0319022openalex-snapshot
Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
inferredcites →https://doi.org/10.1137/0322019openalex-snapshot
Asymptotic Convergence Analysis of the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0325033openalex-snapshot
Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
inferredcites →https://doi.org/10.1137/0327068openalex-snapshot
Exact Penalty Functions in Constrained Optimization
inferredcites →https://doi.org/10.1137/0329022openalex-snapshot
On the Convergence of the Proximal Point Algorithm for Convex Minimization
inferredcites →https://doi.org/10.1137/0329054openalex-snapshot
An Exact Penalization Viewpoint of Constrained Optimization
inferredcites →https://doi.org/10.1137/0330025openalex-snapshot
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
inferredcites →https://doi.org/10.1137/0331048openalex-snapshot
Identifiable Surfaces in Constrained Optimization
inferredcites →https://doi.org/10.1137/0331063openalex-snapshot
Weak Sharp Minima in Mathematical Programming
inferredcites →https://doi.org/10.1137/0713043openalex-snapshot
Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
inferredcites →https://doi.org/10.1137/0725068openalex-snapshot
On the Identification of Active Constraints
inferredcites →https://doi.org/10.1137/0727064openalex-snapshot
On the Identification of Active Constraints II: The Nonconvex Case
inferredcites →https://doi.org/10.1137/0801025openalex-snapshot
On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
inferredcites →https://doi.org/10.1137/0801036openalex-snapshot
On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
inferredcites →https://doi.org/10.1137/0802004openalex-snapshot
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
inferredcites →https://doi.org/10.1137/0802030openalex-snapshot
On the Continuity of the Solution Map in Linear Complementarity Problems
inferredcites →https://doi.org/10.1137/0802033openalex-snapshot
A Necessary and Sufficient Condition for a Constrained Minimum
inferredcites →https://doi.org/10.1137/0803003openalex-snapshot
Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
inferredcites →https://doi.org/10.1137/0803008openalex-snapshot
Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/0803034openalex-snapshot
Convex Functions with Unbounded Level Sets and Applications to Duality Theory
inferredcites →https://doi.org/10.1137/0804021openalex-snapshot
Extension of Hoffman’s Error Bound to Polynomial Systems
inferredcites →https://doi.org/10.1137/0804031openalex-snapshot
Partial Proximal Minimization Algorithms for Convex Pprogramming
inferredcites →https://doi.org/10.1137/0806015openalex-snapshot
A Unified Analysis of Hoffman’s Bound via Fenchel Duality
inferredcites →https://doi.org/10.1137/1.9780898719000openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1137/1036003openalex-snapshot
A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
inferredcites →https://doi.org/10.1137/s0036144593251710openalex-snapshot
On Projection Algorithms for Solving Convex Feasibility Problems
inferredcites →https://doi.org/10.1137/s0036144595285963openalex-snapshot
Engineering and Economic Applications of Complementarity Problems
inferredcites →https://doi.org/10.1137/s036301299222888xopenalex-snapshot
On the Boundedness and Stability of Solutions to the Affine Variational Inequality Problem
inferredcites →https://doi.org/10.1137/s0363012993243022openalex-snapshot
Error Bounds for Piecewise Convex Quadratic Programs and Applications
inferredcites →https://doi.org/10.1137/s0363012994261690openalex-snapshot
Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities
inferredcites →https://doi.org/10.1137/s0363012994277645openalex-snapshot
Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality Problems
inferredcites →https://doi.org/10.1137/s0363012995292548openalex-snapshot
Minimizing and Stationary Sequences of Constrained Optimization Problems
inferredcites →https://doi.org/10.1137/s0363012995293645openalex-snapshot
Global Error Bounds for Convex Inequality Systems in Banach Spaces
inferredcites →https://doi.org/10.1137/s0895479892224768openalex-snapshot
Perturbation Analysis of a Condition Number for Linear Systems
inferredcites →https://doi.org/10.1137/s0895479892237744openalex-snapshot
Approximations to Solutions to Systems of Linear Inequalities
inferredcites →https://doi.org/10.1137/s0895479894278940openalex-snapshot
An Analysis of Zero Set and Global Error Bound Properties of a Piecewise Affine Function via Its Recession Function
inferredcites →https://doi.org/10.1137/s1052623494269035openalex-snapshot
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
inferredcites →https://doi.org/10.1137/s1052623495284029openalex-snapshot
Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
inferredcites →https://doi.org/10.1137/s1052623495284832openalex-snapshot
Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
inferredcites →https://doi.org/10.1137/s1052623495287927openalex-snapshot
Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
inferredcites →https://doi.org/10.1137/s1052623496299187openalex-snapshot
Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
inferredcites →https://doi.org/10.1137/s1052623496305882openalex-snapshot
On the Accurate Identification of Active Constraints
inferredcites →https://doi.org/10.1137/s1052623497318980openalex-snapshot
A Potential Reduction Newton Method for Constrained Equations
inferredcites →https://doi.org/10.1142/2752openalex-snapshot
Recent Advances in Nonsmooth Optimization
inferredcites →https://doi.org/10.1142/2862openalex-snapshot
Recent Trends in Optimization Theory and Applications
inferredcites →https://doi.org/10.1142/9789812798862_0017openalex-snapshot
CONVERGENCE ANALYSIS OF PRIMAL-DUAL INTERIOR POINT ALGORITHMS FOR CONVEX QUADRATIC PROGRAMS
inferredcites →https://doi.org/10.1142/9789812812827_0006openalex-snapshot
An NCP–Function and its Use for the Solution of Complementarity Problems
inferredcites →https://doi.org/10.1287/mnsc.13.5.344openalex-snapshot
Non-Linear Programming Via Penalty Functions
inferredcites →https://doi.org/10.1287/moor.1.2.130openalex-snapshot
Regularity and Stability for Convex Multivalued Functions
inferredcites →https://doi.org/10.1287/moor.10.2.175openalex-snapshot
A Condition Number for Differentiable Convex Inequalities
inferredcites →https://doi.org/10.1287/moor.12.3.474openalex-snapshot
A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem
inferredcites →https://doi.org/10.1287/moor.16.2.292openalex-snapshot
An Implicit-Function Theorem for a Class of Nonsmooth Functions
inferredcites →https://doi.org/10.1287/moor.17.3.691openalex-snapshot
Normal Maps Induced by Linear Transformations
inferredcites →https://doi.org/10.1287/moor.18.4.846openalex-snapshot
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
inferredcites →https://doi.org/10.1287/moor.19.4.880openalex-snapshot
New Error Bounds for the Linear Complementarity Problem
inferredcites →https://doi.org/10.1287/moor.20.3.657openalex-snapshot
Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
inferredcites →https://doi.org/10.1287/moor.21.2.401openalex-snapshot
Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
inferredcites →https://doi.org/10.1287/moor.21.4.793openalex-snapshot
Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
inferredcites →https://doi.org/10.1287/moor.21.4.955openalex-snapshot
Homeomorphism Conditions for Coherently Oriented Piecewise Affine Mappings
inferredcites →https://doi.org/10.1287/moor.23.1.221openalex-snapshot
Nondegeneracy Concepts for Zeros of Piecewise Smooth Functions
inferredcites →https://doi.org/10.1287/moor.23.1.39openalex-snapshot
On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
inferredcites →https://doi.org/10.1287/moor.23.2.443openalex-snapshot
Global Error Bounds for Convex Multifunctions and Applications
inferredcites →https://doi.org/10.1287/moor.23.3.746openalex-snapshot
Convergence to Second Order Stationary Points in Inequality Constrained Optimization
inferredcites →https://doi.org/10.1287/moor.24.1.72openalex-snapshot
Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists
inferredcites →https://doi.org/10.1287/moor.5.1.43openalex-snapshot
Strongly Regular Generalized Equations
inferredcites →https://doi.org/10.21136/cmj.1975.101337openalex-snapshot
Multifunctions with convex closed graph
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.4064/sm-18-1-87-136openalex-snapshot
Sur le problème de la division
inferredcites →https://doi.org/10.6028/jres.049.027openalex-snapshot
On approximate solutions of systems of linear inequalities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-24255-4_3openalex-snapshot
Duality and Exact Penalization via a Generalized Augmented Lagrangian Function
inferred← citeshttps://doi.org/10.1007/3-540-28258-0_9openalex-snapshot
A Note on Error Estimates for some Interior Penalty Methods
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_155openalex-snapshot
Parallel Constrained Optimization via Distribution of Variables
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_1openalex-snapshot
Metric and Topological Tools
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_2openalex-snapshot
Elements of Differential Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_3openalex-snapshot
Elements of Convex Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_4openalex-snapshot
Elementary and Viscosity Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_5openalex-snapshot
Circa-Subdifferentials, Clarke Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_7openalex-snapshot
Graded Subdifferentials, Ioffe Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4615-6357-0_2openalex-snapshot
Nonlinear Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3226-9_24openalex-snapshot
Error Bounds and Superlinear Convergence Analysis of Some Newton-Type Methods in Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-3403-4_4openalex-snapshot
Asymptotic Constraint Qualifications and Error Bounds for Semi-Infinite Systems of Convex Inequalities
inferred← citeshttps://doi.org/10.1007/978-1-4757-6388-1_6openalex-snapshot
Well-Posed Problems and Error Bounds in Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4939-1037-3openalex-snapshot
Implicit Functions and Solution Mappings
inferred← citeshttps://doi.org/10.1007/978-3-030-25939-6_15openalex-snapshot
On the Acceleration of Forward-Backward Splitting via an Inexact Newton Method
inferred← citeshttps://doi.org/10.1007/978-3-030-68281-1_11openalex-snapshot
On Noncritical Solutions of Complementarity Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-91059-4_3openalex-snapshot
On Local Error Bound in Nonlinear Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-14350-2_28openalex-snapshot
Error Bound for the Generalized Complementarity Problem in Engineering and Economic Equilibrium Modeling
inferred← citeshttps://doi.org/10.1007/978-3-642-21114-0_10openalex-snapshot
Levitin–Polyak Type Well-Posedness in Constrained Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-29210-1_6openalex-snapshot
About error bounds in metric spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-57014-8_4openalex-snapshot
Vector Variational Principles Towards Asymptotically Well Behaved Vector Convex Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-48670-2_8openalex-snapshot
Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-981-99-3080-7_15openalex-snapshot
Error Bound for the Linear Complementarity Problem Using Plus Function
inferred← citeshttps://doi.org/10.1007/pl00011406openalex-snapshot
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications
inferred← citeshttps://doi.org/10.1007/s00211-008-0181-7openalex-snapshot
An operator splitting method for variational inequalities with partially unknown mappings
inferred← citeshttps://doi.org/10.1007/s00245-022-09957-xopenalex-snapshot
Linearized Proximal Algorithms with Adaptive Stepsizes for Convex Composite Optimization with Applications
inferred← citeshttps://doi.org/10.1007/s00245-025-10238-6openalex-snapshot
A Generalization of Hoffman’s Lemma in Banach Spaces and Applications
inferred← citeshttps://doi.org/10.1007/s00245-026-10515-yopenalex-snapshot
Convergence Rates of Subgradient Algorithms for Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1007/s00607-008-0021-8openalex-snapshot
Error bounds for complementarity problems with tridiagonal nonlinear functions
inferred← citeshttps://doi.org/10.1007/s10013-014-0098-7openalex-snapshot
Error Bound for Conic Inequality
inferred← citeshttps://doi.org/10.1007/s10013-019-00346-6openalex-snapshot
A Versatile Approach to Metric Regularity, Openness, and Lipschitzian Properties
inferred← citeshttps://doi.org/10.1007/s10013-020-00393-4openalex-snapshot
Bounds on the Objective Value of Feasible Roundings
inferred← citeshttps://doi.org/10.1007/s10107-002-0306-1openalex-snapshot
Non-Interior continuation methods for solving semidefinite complementarity problems
inferred← citeshttps://doi.org/10.1007/s10107-002-0346-6openalex-snapshot
Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods
inferred← citeshttps://doi.org/10.1007/s10107-002-0369-zopenalex-snapshot
Convergence rate analysis of iteractive algorithms for solving variational inequality problems
inferred← citeshttps://doi.org/10.1007/s10107-003-0464-9openalex-snapshot
Regularities and their relations to error bounds
inferred← citeshttps://doi.org/10.1007/s10107-004-0539-2openalex-snapshot
Optimization problems with equilibrium constraints and their numerical solution
inferred← citeshttps://doi.org/10.1007/s10107-005-0615-2openalex-snapshot
Weak sharp minima revisited, part II: application to linear regularity and error bounds
inferred← citeshttps://doi.org/10.1007/s10107-005-0623-2openalex-snapshot
Calmness of constraint systems with applications
inferred← citeshttps://doi.org/10.1007/s10107-005-0624-1openalex-snapshot
Error bounds for convex differentiable inequality systems in Banach spaces
inferred← citeshttps://doi.org/10.1007/s10107-005-0627-yopenalex-snapshot
Error Bounds for Eigenvalue and Semidefinite Matrix Inequality Systems
inferred← citeshttps://doi.org/10.1007/s10107-005-0645-9openalex-snapshot
Computation of Error Bounds for P-matrix Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10107-007-0121-9openalex-snapshot
Error bounds for systems of lower semicontinuous functions in Asplund spaces
inferred← citeshttps://doi.org/10.1007/s10107-007-0130-8openalex-snapshot
Weak sharp minima revisited, Part III: error bounds for differentiable convex inclusions
inferred← citeshttps://doi.org/10.1007/s10107-007-0132-6openalex-snapshot
Condition numbers and error bounds in convex programming
inferred← citeshttps://doi.org/10.1007/s10107-008-0255-4openalex-snapshot
Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
inferred← citeshttps://doi.org/10.1007/s10107-008-0262-5openalex-snapshot
The effect of deterministic noise in subgradient methods
inferred← citeshttps://doi.org/10.1007/s10107-009-0279-4openalex-snapshot
On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
inferred← citeshttps://doi.org/10.1007/s10107-011-0440-8openalex-snapshot
Subsmooth semi-infinite and infinite optimization problems
inferred← citeshttps://doi.org/10.1007/s10107-011-0456-0openalex-snapshot
A relaxed constant positive linear dependence constraint qualification and applications
inferred← citeshttps://doi.org/10.1007/s10107-011-0481-zopenalex-snapshot
Global error bounds for piecewise convex polynomials
inferred← citeshttps://doi.org/10.1007/s10107-012-0556-5openalex-snapshot
The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
inferred← citeshttps://doi.org/10.1007/s10107-012-0586-zopenalex-snapshot
A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
inferred← citeshttps://doi.org/10.1007/s10107-013-0637-0openalex-snapshot
Solving quasi-variational inequalities via their KKT conditions
inferred← citeshttps://doi.org/10.1007/s10107-014-0806-9openalex-snapshot
New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
inferred← citeshttps://doi.org/10.1007/s10107-015-0872-7openalex-snapshot
Error bounds for mixed integer linear optimization problems
inferred← citeshttps://doi.org/10.1007/s10107-016-1014-6openalex-snapshot
Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
inferred← citeshttps://doi.org/10.1007/s10107-016-1091-6openalex-snapshot
From error bounds to the complexity of first-order descent methods for convex functions
inferred← citeshttps://doi.org/10.1007/s10107-017-1165-0openalex-snapshot
Approximations and solution estimates in optimization
inferred← citeshttps://doi.org/10.1007/s10107-017-1193-9openalex-snapshot
Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems
inferred← citeshttps://doi.org/10.1007/s10107-017-1200-1openalex-snapshot
On error bound moduli for locally Lipschitz and regular functions
inferred← citeshttps://doi.org/10.1007/s10107-018-1246-8openalex-snapshot
Error bounds for monomial convexification in polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10107-018-1280-6openalex-snapshot
A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo–Tseng error bound property
inferred← citeshttps://doi.org/10.1007/s10107-019-01416-wopenalex-snapshot
Golden ratio algorithms for variational inequalities
inferred← citeshttps://doi.org/10.1007/s10107-019-01439-3openalex-snapshot
Amenable cones: error bounds without constraint qualifications
inferred← citeshttps://doi.org/10.1007/s10107-020-01473-6openalex-snapshot
New characterizations of Hoffman constants for systems of linear constraints
inferred← citeshttps://doi.org/10.1007/s10107-021-01756-6openalex-snapshot
Error bounds and a condition number for the absolute value equations
inferred← citeshttps://doi.org/10.1007/s10107-022-01860-1openalex-snapshot
Exact computation of an error bound for the balanced linear complementarity problem with unique solution
inferred← citeshttps://doi.org/10.1007/s10107-022-01883-8openalex-snapshot
Error bounds, facial residual functions and applications to the exponential cone
inferred← citeshttps://doi.org/10.1007/s101070050015openalex-snapshot
Exact order of Hoffman’s error bounds for elliptic quadratic inequalities derived from vector-valued Chebyshev approximation
inferred← citeshttps://doi.org/10.1007/s101070050016openalex-snapshot
Error bounds for infinite systems of convex inequalities without Slater’s condition
inferred← citeshttps://doi.org/10.1007/s101070050017openalex-snapshot
Perturbation analysis of global error bounds for systems of linear inequalities
inferred← citeshttps://doi.org/10.1007/s101070050020openalex-snapshot
New error bounds and their applications to convergence analysis of iterative algorithms
inferred← citeshttps://doi.org/10.1007/s101070050022openalex-snapshot
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
inferred← citeshttps://doi.org/10.1007/s101070050023openalex-snapshot
Global s-type error bound for the extended linear complementarity problem and applications
inferred← citeshttps://doi.org/10.1007/s101070050083openalex-snapshot
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
inferred← citeshttps://doi.org/10.1007/s10114-014-2522-zopenalex-snapshot
Sufficient conditions for error bounds and linear regularity in Banach spaces
inferred← citeshttps://doi.org/10.1007/s10208-022-09586-4openalex-snapshot
Convergence Analysis under Consistent Error Bounds
inferred← citeshttps://doi.org/10.1007/s10440-015-0037-yopenalex-snapshot
A Lipschitzian Error Bound for Convex Quadratic Symmetric Cone Programming
inferred← citeshttps://doi.org/10.1007/s10440-018-0158-1openalex-snapshot
Conditions for Error Bounds of Linear Complementarity Problems over Second-Order Cones with Pseudomonotonicity
inferred← citeshttps://doi.org/10.1007/s10444-019-09708-7openalex-snapshot
Local convergence of the Levenberg–Marquardt method under Hölder metric subregularity
inferred← citeshttps://doi.org/10.1007/s10483-012-1548-6openalex-snapshot
New exact penalty function for solving constrained finite min-max problems
inferred← citeshttps://doi.org/10.1007/s10543-008-0202-zopenalex-snapshot
Components identification based method for box constrained variational inequality problems with almost linear functions
inferred← citeshttps://doi.org/10.1007/s10589-005-2177-xopenalex-snapshot
Quadratic Convergence of a Primal-Dual Interior Point Method for Degenerate Nonlinear Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10589-005-3063-2openalex-snapshot
On Generalizations of the Frank-Wolfe Theorem to Convex and Quasi-Convex Programmes
inferred← citeshttps://doi.org/10.1007/s10589-007-9157-2openalex-snapshot
A stable primal–dual approach for linear programming under nondegeneracy assumptions
inferred← citeshttps://doi.org/10.1007/s10589-008-9208-3openalex-snapshot
Extended duality for nonlinear programming
inferred← citeshttps://doi.org/10.1007/s10589-010-9349-zopenalex-snapshot
Computation of generalized differentials in nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1007/s10589-013-9586-zopenalex-snapshot
A new error bound result for Generalized Nash Equilibrium Problems and its algorithmic application
inferred← citeshttps://doi.org/10.1007/s10589-013-9595-yopenalex-snapshot
On error bounds and Newton-type methods for generalized Nash equilibrium problems
inferred← citeshttps://doi.org/10.1007/s10589-014-9656-xopenalex-snapshot
A regularized Newton method without line search for unconstrained optimization
inferred← citeshttps://doi.org/10.1007/s10589-014-9698-0openalex-snapshot
A smoothing Levenberg–Marquardt algorithm for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/s10589-014-9699-zopenalex-snapshot
Improved error bound and a hybrid method for generalized Nash equilibrium problems
inferred← citeshttps://doi.org/10.1007/s10589-015-9777-xopenalex-snapshot
Bounded perturbation resilience of projected scaled gradient methods
inferred← citeshttps://doi.org/10.1007/s10589-015-9791-zopenalex-snapshot
Active-set prediction for interior point methods using controlled perturbations
inferred← citeshttps://doi.org/10.1007/s10589-019-00111-yopenalex-snapshot
Modified inexact Levenberg–Marquardt methods for solving nonlinear least squares problems
inferred← citeshttps://doi.org/10.1007/s10589-020-00245-4openalex-snapshot
Nonconvex robust programming via value-function optimization
inferred← citeshttps://doi.org/10.1007/s10589-021-00300-8openalex-snapshot
Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1007/s10589-021-00342-yopenalex-snapshot
On a primal-dual Newton proximal method for convex quadratic programs
inferred← citeshttps://doi.org/10.1007/s10589-024-00576-6openalex-snapshot
A hybrid inexact regularized Newton and negative curvature method
inferred← citeshttps://doi.org/10.1007/s10589-026-00837-6openalex-snapshot
On the solvability of SOCCPs via smoothing Levenberg–Marquardt approach under local error bound
inferred← citeshttps://doi.org/10.1007/s10898-004-7020-xopenalex-snapshot
Hoffman?s Least Error Bounds for Systems of Linear Inequalities
inferred← citeshttps://doi.org/10.1007/s10898-005-3837-1openalex-snapshot
Partial Augmented Lagrangian Method and Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10898-006-9050-zopenalex-snapshot
Levitin–Polyak well-posedness of constrained vector optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-011-9662-9openalex-snapshot
Minimum recession-compatible subsets of closed convex sets
inferred← citeshttps://doi.org/10.1007/s10898-011-9765-3openalex-snapshot
Exact penalty and error bounds in DC programming
inferred← citeshttps://doi.org/10.1007/s10898-013-0073-yopenalex-snapshot
Vector quasi-equilibrium problems: separation, saddle points and error bounds for the solution set
inferred← citeshttps://doi.org/10.1007/s10898-014-0186-yopenalex-snapshot
Error estimation in nonlinear optimization
inferred← citeshttps://doi.org/10.1007/s10957-004-5155-zopenalex-snapshot
Characterizing Nonemptiness and Compactness of the Solution Set of a Convex Vector Optimization Problem with Cone Constraints and Applications
inferred← citeshttps://doi.org/10.1007/s10957-005-4715-1openalex-snapshot
Geometric Condition Measures and Smoothness Condition Measures for Closed Convex Sets and Linear Regularity of Infinitely Many Closed Convex Sets
inferred← citeshttps://doi.org/10.1007/s10957-006-9053-4openalex-snapshot
Superlinearly Convergent Trust-Region Method without the Assumption of Positive-Definite Hessian
inferred← citeshttps://doi.org/10.1007/s10957-006-9060-5openalex-snapshot
Inexact Operator Splitting Methods with Selfadaptive Strategy for Variational Inequality Problems
inferred← citeshttps://doi.org/10.1007/s10957-009-9509-4openalex-snapshot
Global Error Bound for the Generalized Linear Complementarity Problem over a Polyhedral Cone
inferred← citeshttps://doi.org/10.1007/s10957-009-9625-1openalex-snapshot
Vector Variational Inequalities Involving Set-valued Mappings via Scalarization with Applications to Error Bounds for Gap Functions
inferred← citeshttps://doi.org/10.1007/s10957-010-9666-5openalex-snapshot
Second-Order Analysis of Penalty Function
inferred← citeshttps://doi.org/10.1007/s10957-010-9691-4openalex-snapshot
Image Space Analysis for Vector Variational Inequalities with Matrix Inequality Constraints and Applications
inferred← citeshttps://doi.org/10.1007/s10957-011-9821-7openalex-snapshot
Error Bounds for Nonlinear Complementarity Problems with Band Structure
inferred← citeshttps://doi.org/10.1007/s10957-011-9825-3openalex-snapshot
A Projection-Proximal Point Algorithm for Solving Generalized Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s10957-011-9903-6openalex-snapshot
Stability Analysis of One Stage Stochastic Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s10957-013-0290-zopenalex-snapshot
Further Discussion on the Error Bound for Generalized Linear Complementarity Problem over a Polyhedral Cone
inferred← citeshttps://doi.org/10.1007/s10957-013-0371-zopenalex-snapshot
Calmness of the Argmin Mapping in Linear Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/s10957-014-0643-2openalex-snapshot
On Calmness of the Argmin Mapping in Parametric Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-015-0839-0openalex-snapshot
Optimality Functions and Lopsided Convergence
inferred← citeshttps://doi.org/10.1007/s10957-016-0862-9openalex-snapshot
Solving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques
inferred← citeshttps://doi.org/10.1007/s10957-016-0967-1openalex-snapshot
Error Bounds Via Exact Penalization with Applications to Concave and Quadratic Systems
inferred← citeshttps://doi.org/10.1007/s10957-018-1240-6openalex-snapshot
Slopes, Error Bounds and Weak Sharp Pareto Minima of a Vector-Valued Map
inferred← citeshttps://doi.org/10.1007/s10957-018-1356-8openalex-snapshot
Error Bounds for the Solution Sets of Quadratic Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10957-019-01484-0openalex-snapshot
Second-Order Strong Karush/Kuhn–Tucker Conditions for Proper Efficiencies in Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/s10957-019-01591-yopenalex-snapshot
Granularity in Nonlinear Mixed-Integer Optimization
inferred← citeshttps://doi.org/10.1007/s10957-020-01749-zopenalex-snapshot
Constraint Qualifications for Karush–Kuhn–Tucker Conditions in Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/s10957-020-01774-yopenalex-snapshot
Acceptable Solutions and Backward Errors for Tensor Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10957-021-01827-wopenalex-snapshot
On the Linear Convergence to Weak/Standard d-Stationary Points of DCA-Based Algorithms for Structured Nonsmooth DC Programming
inferred← citeshttps://doi.org/10.1007/s10957-021-01839-6openalex-snapshot
A Nonmonotone Smoothing Newton Algorithm for Weighted Complementarity Problem
inferred← citeshttps://doi.org/10.1007/s10957-021-01865-4openalex-snapshot
Level-Set Subdifferential Error Bounds and Linear Convergence of Bregman Proximal Gradient Method
inferred← citeshttps://doi.org/10.1007/s10957-025-02644-1openalex-snapshot
Tight Error Bounds for Log-Determinant Cones Without Constraint Qualifications
inferred← citeshttps://doi.org/10.1007/s10957-025-02819-wopenalex-snapshot
A Simultaneous Quasi-Subgradient Method for Minimizing Convex Function with Quasi-Convex Functional Constraints
inferred← citeshttps://doi.org/10.1007/s10957-026-02935-1openalex-snapshot
Convergence of Linearized Proximal Algorithms with Adaptive Stepsizes for Convex Composite Optimization
inferred← citeshttps://doi.org/10.1007/s10957-026-02951-1openalex-snapshot
On a Robust Approach to “split” Feasibility Problems: Solvability and Global Error Bound Conditions
inferred← citeshttps://doi.org/10.1007/s10957-026-02965-9openalex-snapshot
A New Constant-Rank-Type Condition Related to MFCQ and Local Error Bounds
inferred← citeshttps://doi.org/10.1007/s10957-026-03023-0openalex-snapshot
A Unified Approach to Smoothing and Regularization for SOCCPs under Local Error Bound
inferred← citeshttps://doi.org/10.1007/s11067-024-09632-4openalex-snapshot
Proximal Point Algorithms with Inertial Extrapolation for Quasi-convex Pseudo-monotone Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/s11075-021-01170-1openalex-snapshot
An infeasible projection type algorithm for nonmonotone variational inequalities
inferred← citeshttps://doi.org/10.1007/s11075-023-01556-3openalex-snapshot
Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem
inferred← citeshttps://doi.org/10.1007/s11117-017-0509-6openalex-snapshot
The global weak sharp minima with explicit exponents in polynomial vector optimization problems
inferred← citeshttps://doi.org/10.1007/s11228-006-0023-7openalex-snapshot
Sharp Minima for Multiobjective Optimization in Banach Spaces
inferred← citeshttps://doi.org/10.1007/s11228-010-0133-0openalex-snapshot
Error Bounds: Necessary and Sufficient Conditions
inferred← citeshttps://doi.org/10.1007/s11228-010-0172-6openalex-snapshot
Global Error Bounds for γ-paraconvex Multifunctions
inferred← citeshttps://doi.org/10.1007/s11228-012-0210-7openalex-snapshot
Coderivative Conditions for Error Bounds of γ-paraconvex Multifunctions
inferred← citeshttps://doi.org/10.1007/s11228-012-0214-3openalex-snapshot
Strong Fermat Rules for Constrained Set-Valued Optimization Problems on Banach Spaces
inferred← citeshttps://doi.org/10.1007/s11228-012-0217-0openalex-snapshot
Equivalent Conditions for Local Error Bounds
inferred← citeshttps://doi.org/10.1007/s11228-013-0271-2openalex-snapshot
Error Bounds for the Difference of Two Convex Multifunctions
inferred← citeshttps://doi.org/10.1007/s11228-015-0330-yopenalex-snapshot
Error Bounds and Hölder Metric Subregularity
inferred← citeshttps://doi.org/10.1007/s11228-020-00551-3openalex-snapshot
Error Bounds for Approximate Solutions of Abstract Inequality Systems and Infinite Systems of Inequalities on Banach Spaces
inferred← citeshttps://doi.org/10.1007/s11228-020-00568-8openalex-snapshot
Constrained Lipschitzian Error Bounds and Noncritical Solutions of Constrained Equations
inferred← citeshttps://doi.org/10.1007/s11228-020-00571-zopenalex-snapshot
On the Quantitative Solution Stability of Parameterized Set-Valued Inclusions
inferred← citeshttps://doi.org/10.1007/s11228-023-00694-zopenalex-snapshot
Nonlocal Error Bounds for Piecewise Affine Functions
inferred← citeshttps://doi.org/10.1007/s11228-024-00727-1openalex-snapshot
Subtransversality and Strong CHIP of Closed Sets in Asplund Spaces
inferred← citeshttps://doi.org/10.1007/s11425-011-4287-5openalex-snapshot
Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
inferred← citeshttps://doi.org/10.1007/s11590-010-0192-zopenalex-snapshot
Error analysis of approximate solutions to parametric vector quasiequilibrium problems
inferred← citeshttps://doi.org/10.1007/s11590-011-0369-0openalex-snapshot
New characterizations of weak sharp minima
inferred← citeshttps://doi.org/10.1007/s11590-013-0648-zopenalex-snapshot
Linear and nonlinear error bounds for lower semicontinuous functions
inferred← citeshttps://doi.org/10.1007/s11590-015-0992-2openalex-snapshot
Nonlinear error bounds for quasiconvex inequality systems
inferred← citeshttps://doi.org/10.1007/s11590-016-1011-yopenalex-snapshot
Error bounds for mixed integer nonlinear optimization problems
inferred← citeshttps://doi.org/10.1007/s11590-018-1373-4openalex-snapshot
Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system
inferred← citeshttps://doi.org/10.1007/s11590-020-01578-zopenalex-snapshot
A new notion of error bounds: necessary and sufficient conditions
inferred← citeshttps://doi.org/10.1007/s11590-022-01882-wopenalex-snapshot
A low-rank spectral method for learning Markov models
inferred← citeshttps://doi.org/10.1007/s11750-011-0187-7openalex-snapshot
Error bound results for convex inequality systems via conjugate duality
inferred← citeshttps://doi.org/10.1007/s11750-014-0353-9openalex-snapshot
On error bounds for systems
inferred← citeshttps://doi.org/10.1007/s11784-018-0556-zopenalex-snapshot
A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
inferred← citeshttps://doi.org/10.1007/s40306-017-0209-0openalex-snapshot
Hölder-Type Global Error Bounds for Non-degenerate Polynomial Systems
inferred← citeshttps://doi.org/10.1007/s40306-025-00592-6openalex-snapshot
Global Error Bounds for Nonmonotone Affine Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s40314-015-0222-7openalex-snapshot
A nonmonotone Levenberg–Marquardt method for nonlinear complementarity problems under local error bound
inferred← citeshttps://doi.org/10.1007/s44007-025-00163-zopenalex-snapshot
Block Matrix and Tensor Randomized Kaczmarz Methods for Linear Feasibility Problems
inferred← citeshttps://doi.org/10.1016/j.amc.2004.03.005openalex-snapshot
Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
inferred← citeshttps://doi.org/10.1016/j.amc.2005.11.036openalex-snapshot
A smoothing Levenberg–Marquardt method for NCP
inferred← citeshttps://doi.org/10.1016/j.amc.2011.04.009openalex-snapshot
A double projection algorithm for multi-valued variational inequalities and a unified framework of the method
inferred← citeshttps://doi.org/10.1016/j.amc.2013.12.039openalex-snapshot
A subgradient extragradient algorithm for solving multi-valued variational inequality
inferred← citeshttps://doi.org/10.1016/j.amc.2014.01.121openalex-snapshot
A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.amc.2015.09.020openalex-snapshot
On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
inferred← citeshttps://doi.org/10.1016/j.amc.2019.04.048openalex-snapshot
Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM
inferred← citeshttps://doi.org/10.1016/j.aml.2012.03.020openalex-snapshot
A note on weak sharp minima in multicriteria linear programming
inferred← citeshttps://doi.org/10.1016/j.apm.2010.09.012openalex-snapshot
Smoothing Levenberg–Marquardt method for general nonlinear complementarity problems under local error bound
inferred← citeshttps://doi.org/10.1016/j.apnum.2008.03.028openalex-snapshot
Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
inferred← citeshttps://doi.org/10.1016/j.automatica.2019.108801openalex-snapshot
FBstab: A proximally stabilized semismooth algorithm for convex quadratic programming
inferred← citeshttps://doi.org/10.1016/j.automatica.2020.108973openalex-snapshot
Time-distributed optimization for real-time model predictive control: Stability, robustness, and constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.cam.2005.01.031openalex-snapshot
A new double projection algorithm for variational inequalities
inferred← citeshttps://doi.org/10.1016/j.cam.2008.09.014openalex-snapshot
An algorithm for generalized variational inequality with pseudomonotone mapping
inferred← citeshttps://doi.org/10.1016/j.cam.2009.11.041openalex-snapshot
Gap functions and global error bounds for set-valued variational inequalities
inferred← citeshttps://doi.org/10.1016/j.cam.2015.06.022openalex-snapshot
A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2024.116288openalex-snapshot
Global error bound estimates algorithm for an R0 -type generalized LCP over polyhedral cone and its applications
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.01.004openalex-snapshot
Weak sharp minima for set-valued vector variational inequalities with an application
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.10.005openalex-snapshot
Hölder continuity and upper estimates of solutions to vector quasiequilibrium problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.05.017openalex-snapshot
Inexact subgradient methods for quasi-convex optimization problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.09.029openalex-snapshot
Quasi-convex feasibility problems: Subgradient methods and convergence rates
inferred← citeshttps://doi.org/10.1016/j.fss.2020.03.005openalex-snapshot
A generalized Hellinger distance for Choquet integral
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2024.08.022openalex-snapshot
On Łojasiewicz inequalities and the effective Putinar's Positivstellensatz
inferred← citeshttps://doi.org/10.1016/j.jmaa.2008.07.052openalex-snapshot
Global weak sharp minima for convex (semi-)infinite optimization problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2012.04.081openalex-snapshot
Weak sharpness for gap functions in vector variational inequalities
showing the first 200 of 416 · page through all 416
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.