Optimality conditions for nondifferentiable convex semi-infinite programming

Marco A. López; Enriqueta Vercher

doi:10.1007/bf02591906

ScienceGate Book Chapters

JOURNAL ARTICLE

Optimality conditions for nondifferentiable convex semi-infinite programming

Marco A. López Enriqueta Vercher

Year: 1983 Journal: Mathematical Programming Vol: 27 (3)Pages: 307-319 Publisher: Springer Science+Business Media

DOI: 10.1007/bf02591906

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Constraint (computer-aided design) Mathematical optimization Relation (database) Regular polygon Minkowski addition Set (abstract data type) Convex set Subderivative Property (philosophy) Convex optimization Applied mathematics Computer science Geometry

Metrics

Cited By

1.09

FWCI (Field Weighted Citation Impact)

Refs

0.75

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Variational Analysis

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

Point processes and geometric inequalities

Physical Sciences → Mathematics → Applied Mathematics

Optimality conditions for nondifferentiable convex semi-infinite programming

Metrics

Citation History

Topics

Related Documents

Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems

Sufficient optimality conditions for convex semi-infinite programming

Optimality conditions for convex semi‐infinite programming problems

On First-Order Conditions for Optimality of Nondifferentiable Semi-infinite Programming

Optimality Conditions for Nondifferentiable Multiobjective Semi-infinite Programming with Generalized Convexity