Error bounds in mathematical programming (Q1365060): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 11:39, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	Error bounds in mathematical programming	scientific article

Statements

scholarly article

0 references

Error bounds in mathematical programming (English)

0 references

zbMATH Open document ID

0 references

10.1007/BF02614322

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

25 May 1998

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

inequality systems

0 references

penalty function

0 references

error bounds

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Variational principles for variational inequalities

0 references

Convergence of stationary sequences for variational inequalities with maximal monotone operators

0 references

Convex Functions with Unbounded Level Sets and Applications to Duality Theory

0 references

Global Regularity Theorems

0 references

Well behaved asymptotical convex functions

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

0 references

0 references

The distance to a polyhedron

0 references

Projection methods for variational inequalities with application to the traffic assignment problem

0 references

Partial Proximal Minimization Algorithms for Convex Pprogramming

0 references

Semianalytic and subanalytic sets

0 references

Stability and regular points of inequality systems

0 references

Verifiable necessary and sufficient conditions for openness and regularity of set-valued and single-valued maps

0 references

Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993

0 references

On the Identification of Active Constraints II: The Nonconvex Case

0 references

An Exact Penalization Viewpoint of Constrained Optimization

0 references

Weak Sharp Minima in Mathematical Programming

0 references

On the Identification of Active Constraints

0 references

Exposing Constraints

0 references

A Unified Analysis of Hoffman’s Bound via Fenchel Duality

0 references

Minimizing and Stationary Sequences of Constrained Optimization Problems

0 references

Optimization and nonsmooth analysis

0 references

Sensitivity theorems in integer linear programming

0 references

0 references

Penalty functions in subanalytic optimization

0 references

Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces

0 references

Computable error bounds for semidefinite programming

0 references

Exact barrier function methods for Lipschitz programs

0 references

Exact Penalty Functions in Constrained Optimization

0 references

Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets

0 references

Well-posed optimization problems

0 references

Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes

0 references

A Study of Indicators for Identifying Zero Variables in Interior-Point Methods

0 references

On the Accurate Identification of Active Constraints

0 references

Convergence to Second Order Stationary Points in Inequality Constrained Optimization

0 references

Finite termination of the proximal point algorithm

0 references

Minimum principle sufficiency

0 references

Error bounds and strong upper semicontinuity for monotone affine variational inequalities

0 references

Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities

0 references

Engineering and Economic Applications of Complementarity Problems

0 references

A special newton-type optimization method

0 references

0 references

On finite termination of an iterative method for linear complementarity problems

0 references

Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems

0 references

0 references

0 references

An inexact NE/SQP method for solving the nonlinear complementarity problem

0 references

On the Continuity of the Solution Map in Linear Complementarity Problems

0 references

An Analysis of Zero Set and Global Error Bound Properties of a Piecewise Affine Function via Its Recession Function

0 references

On the Boundedness and Stability of Solutions to the Affine Variational Inequality Problem

0 references

On the Lipschitzian properties of polyhedral multifunctions

0 references

0 references

On the Convergence of the Proximal Point Algorithm for Convex Minimization

0 references

Approximations to Solutions to Systems of Linear Inequalities

0 references

Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

0 references

The gap function of a convex program

0 references

The Distance to the Intersection of Two Convex Sets Expressed by the Distances to Each of Them

0 references

On the division of distributions by polynomials

0 references

On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method

0 references

Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming

0 references

Equivalence of the generalized complementarity problem to differentiable unconstrained minimization

0 references

New NCP-functions and their properties

0 references

0 references

0 references

Asymptotic constraint qualifications and global error bounds for convex inequalities.

0 references

Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices

0 references

0 references

Combined Primal–Dual and Penalty Methods for Convex Programming

0 references

0 references

0 references

The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program

0 references

Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem

0 references

Error Bounds for Piecewise Convex Quadratic Programs and Applications

0 references

Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities

0 references

Global Error Bounds for Convex Multifunctions and Applications

0 references

Sur le problème de la division

0 references

Extension of Hoffman’s Error Bound to Polynomial Systems

0 references

On a global projection-type error bound for the linear complementarity problem

0 references

0 references

New Error Bounds for the Linear Complementarity Problem

0 references

Error bounds for analytic systems and their applications

0 references

Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints

0 references

Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming

0 references

On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization

0 references

On the convergence of the coordinate descent method for convex differentiable minimization

0 references

Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem

0 references

On the convergence of the affine-scaling algorithm

0 references

Error bounds and convergence analysis of feasible descent methods: A general approach

0 references

Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set

0 references

On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization

0 references

Perturbation Analysis of a Condition Number for Linear Systems

0 references

On the rate of convergence of a distributed asynchronous routing algorithm

0 references

0 references

Asymptotic Convergence Analysis of the Proximal Point Algorithm

0 references

0 references

A Condition Number for Differentiable Convex Inequalities

0 references

Error bounds for nondegenerate monotone linear complementarity problems

0 references

Global error bounds for monotone affine variational inequality problems

0 references

Error bounds for inconsistent linear inequalities and programs

0 references

Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification

0 references

0 references

Exact penalty for mathematical programs with linear complementarity constraints

0 references

New improved error bounds for the linear complementarity problem

0 references

Error bounds for monotone linear complementarity problems

0 references

Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems

0 references

Nonlinear complementarity as unconstrained and constrained minimization

0 references

Error bounds for the linear complementarity problem with a P-matrix

0 references

Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem

0 references

Local convergence of interior-point algorithms for degenerate monotone LCP

0 references

Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions

0 references

Lipschitzian \(\mathbb{Q}\)-matrices are \(\mathbb{P}\)-matrices

0 references

0 references

0 references

Inexact Newton methods for the nonlinear complementarity problem

0 references

0 references

NE/SQP: A robust algorithm for the nonlinear complementarity problem

0 references

Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps

0 references

Two-stage parallel iterative methods for the symmetric linear complementarity problem

0 references

Metric regularity, openness and Lipschitzian behavior of multifunctions

0 references

A new proof of Robinson's homeomorphism theorem for pl-normal maps

0 references

An Application of Error Bounds for Convex Programming in a Linear Space

0 references

Regularity and Stability for Convex Multivalued Functions

0 references

Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems

0 references

Strongly Regular Generalized Equations

0 references

Some continuity properties of polyhedral multifunctions

0 references

An Implicit-Function Theorem for a Class of Nonsmooth Functions

0 references

Normal Maps Induced by Linear Transformations

0 references

Convex Analysis

0 references

Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity

0 references

Homeomorphism Conditions for Coherently Oriented Piecewise Affine Mappings

0 references

0 references

Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists

0 references

Nondegeneracy Concepts for Zeros of Piecewise Smooth Functions

0 references

A globally convergent Newton method for solving strongly monotone variational inequalities

0 references

On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm

0 references

On linear convergence of iterative methods for the variational inequality problem

0 references

0 references

A Lipschitzian Characterization of Convex Polyhedra

0 references

Global error bounds for convex quadratic inequality systems<sup>*</sup>

0 references

A Necessary and Sufficient Condition for a Constrained Minimum

0 references

Identifiable Surfaces in Constrained Optimization

0 references

Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality Problems

0 references

Unconstrained optimization reformulations of variational inequality problems

0 references

0 references

Non-Linear Programming Via Penalty Functions

0 references

full work available at URL

https://doi.org/10.1007/bf02614322

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1365060

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1365060&oldid=37319715"