A simple closure condition for the normal cone intersection formula
From MaRDI portal
Publication:4654124
DOI10.1090/S0002-9939-04-07844-XzbMATH Open1065.46055OpenAlexW1517224067WikidataQ58048576 ScholiaQ58048576MaRDI QIDQ4654124FDOQ4654124
Authors: R. S. Burachik, V. Jeyakumar 
Publication date: 1 March 2005
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9939-04-07844-x
Recommendations
- An Intersection Formula for the Normal Cone Associated with the Hypertangent Cone
- A closedness criterion for the difference of two closed convex sets in general Banach spaces
- On the intersection of contingent cones
- A dual condition for the convex subdifferential sum formula with applications
- Closedness of a convex cone and application by means of the end set of a convex set
Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Generalizations of Slater's constraint qualification for infinite convex programs
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- A simple constraint qualification in infinite dimensional programming
- On the closedness of the algebraic difference of closed convex sets.
- Title not available (Why is that?)
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
- Duality and infinite dimensional optimization
- Bounded linear regularity, strong CHIP, and CHIP are distinct properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Intersection Formula for the Normal Cone Associated with the Hypertangent Cone
Cited In (30)
- Error bounds and multipliers in constrained optimization problems with tolerance
- A new projection method for finding the closest point in the intersection of convex sets
- Revisiting some rules of convex analysis
- On calculating the normal cone to a finite union of convex polyhedra†
- Optimality conditions in discrete-continuous nonlinear optimization
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Necessary and sufficient conditions for stable conjugate duality
- On conic QPCCs, conic QCQPs and completely positive programs
- Closedness of a convex cone and application by means of the end set of a convex set
- Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
- Approximate global minimizers to pairwise interaction problems via convex relaxation
- Closedness of a convex cone and application by means of the end set of a convex set
- A Global Approach to Nonlinearly Constrained Best Approximation
- The strong conical hull intersection property for convex programming
- Strengthened splitting methods for computing resolvents
- An alternative formulation for a new closed cone constraint qualification
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- An approach for the convex feasibility problem via monotropic programming
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- An Intersection Formula for the Normal Cone Associated with the Hypertangent Cone
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- External tangents and closedness of cone + subspace
- Variational properties of the abstract subdifferential operator
- Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- A splitting method for finding the resolvent of the sum of two maximal monotone operators
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions
- Stability in Affine Optimal Control Problems Constrained by Semilinear Elliptic Partial Differential Equations
This page was built for publication: A simple closure condition for the normal cone intersection formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4654124)
