Subdifferential Conditions for Calmness of Convex Constraints

SIAM Journal on Optimization - United States
doi 10.1137/s1052623401386071
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Subdifferential Calculus Rules for Supremum Functions in Convex Analysis

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2011English

Iterative Schemes for Convex Minimization Problems With Constraints

Abstract and Applied Analysis
Applied MathematicsAnalysis
2014English

Distributed Algorithms for Convex Problems With Linear Coupling Constraints

Journal of Global Optimization
ControlOptimizationApplied MathematicsManagement ScienceComputer Science ApplicationsOperations Research
2019English

An Algorithm for Indefinite Quadratic Programming With Convex Constraints

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
1991English

Convexity Conditions for Non-Locally Convex Lattices

Glasgow Mathematical Journal
Mathematics
1984English

A Duality Theorem for Nondifferentiable Convex Programming With Operatorial Constraints

Bulletin of the Australian Mathematical Society
Mathematics
1980English

Optimality Conditions for a Cone-Convex Programming Problem

Journal of the Australian Mathematical Society
Mathematics
1979English

Continuous Dependence Results for Subdifferential Inclusions

Zeitschrift fur Analysis und ihre Anwendung
Applied MathematicsAnalysis
1993English

Minimality Conditions for Convex Composite Functions and Efficiency Conditions in Vector Optimization

Applied Set-Valued Analysis and Optimization
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy