On the B-differential of the componentwise minimum of two affine vector functions

DOI10.1007/S12532-024-00266-8MaRDI QIDQ7008346zbMATH OpenFDO

Authors Jean-Pierre Dussault, J. Ch. Gilbert, Baptiste Plaquevent-Jourdain

Publication date 21 March 2025

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12532-024-00266-8

zbMATH Keywords

complementarity problemconnectivitydual approachhyperplane arrangementpointed coneB-differentialmatroid circuitstrict linear inequalitiesbipartition of a finite setC-differentialcomponentwise minimum of functionsGordan's alternativeSchläfli's boundstem vectorWinder's formula

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Partitions of sets (05A18) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Connectivity (05C40) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Linear operator inequalities (47A63) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Numerical methods for variational inequalities and related problems (65K15) Nondifferentiability (nondifferentiable functions, points of nondifferentiability), discontinuous derivatives (26A27) Duality theory (optimization) (49N15) Differentiation (real functions of one variable): general theory, generalized derivatives, mean value theorems (26A24)

Cites work

• scientific article; zbMATH DE number 1667417 (Why is no real title available?)
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 5138821 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 3475463 (Why is no real title available?)
• scientific article; zbMATH DE number 757678 (Why is no real title available?)
• scientific article; zbMATH DE number 3394958 (Why is no real title available?)
• A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
• A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• A class of optimization problems motivated by rank estimators in robust regression
• A generalization of the linear complementarity problem
• A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
• A nonsmooth version of Newton's method
• A recursive sweep-plane algorithm, determining all cells of a finite division of R^ m.
• A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
• About solving linear equations with real coefficients.
• An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
• An algorithmic characterization of P-matricity
• An introduction to hyperplane arrangements
• Applications of random sampling in computational geometry. II
• Arrangements of planes in space
• Computation of generalized differentials in nonlinear complementarity problems
• Computing characteristic polynomials of hyperplane arrangements with symmetries
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Convex Analysis
• Convex analysis and nonlinear optimization. Theory and examples.
• Deformations of Coxeter hyperplane arrangements
• EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
• Efficient enumeration of solutions produced by closure operations
• Einige Gesetze über die Theilung der Ebene und des Raumes.
• Elements of Information Theory
• Erratum to: Arrangements of planes in space
• Exact computation of an error bound for the balanced linear complementarity problem with unique solution
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Fully coupled generalized hybrid-mixed finite element approximation of two-phase two-component flow in porous media. I: Formulation and properties of the mathematical model
• Gas phase appearance and disappearance as a problem with complementarity constraints
• Global error bounds for the extended vertical LCP
• Hyperplane arrangements separating arbitrary vertex classes in \(n\)-cubes
• Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
• Newton's Method for B-Differentiable Equations
• Newton's method for linear complementarity problems
• Newton-Type Methods for Optimization and Variational Problems
• Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
• Nonsmooth Equations: Motivation and Algorithms
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Numerical optimization. Theoretical and practice aspects
• On a new exponential iterative method for solving nonsmooth equations
• On the Complexity of Some Enumeration Problems for Matroids
• On the figures formed by the intercepts of a system of straight lines in a plane, and on analogons relations in space of three dimensions.
• Optimization and nonsmooth analysis
• Output-sensitive cell enumeration in hyperplane arrangements
• Partitions ofN-Space by Hyperplanes
• Polynomial threshold functions, hyperplane arrangements, and random tensors
• Reverse search for enumeration
• Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
• The Generalized Order Linear Complementarity Problem
• The Linear Complementarity Problem
• The universality of the resonance arrangement and its Betti numbers
• Topics in hyperplane arrangements
• Trees and hills: methodology for maximizing functions of systems of linear relations
• Über partielle und totale Differenzierbarkeit von Funktionen mehrerer Variablen und über die Transformation der Doppelintegrale. I, II.

Cited in

(1)

• Polyhedral Newton-min algorithms for complementarity problems

This page was built for publication: On the B-differential of the componentwise minimum of two affine vector functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008346)