ScholarLens Back to search
2019•AIP conference proceedingsRequires access

Sequential optimality conditions for convex optimization

K. Jeyalakshmi, K. Poornima

Open publisher page 0 citations

Abstract

We study a sequential optimality conditions for a non-smooth objective and constraint functions. We prove for a minimum point, Approximate KKT conditions are satisfied. We consider convex objective and constraint functions which are not necessarily smooth.

About this research paper

What this paper is about

We study a sequential optimality conditions for a non-smooth objective and constraint functions. We prove for a minimum point, Approximate KKT conditions are satisfied. We consider convex objective and constraint functions which are not necessarily smooth.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We study a sequential optimality conditions for a non-smooth objective and constraint functions. We prove for a minimum point, Approximate KKT conditions are satisfied. We consider convex objective and constraint functions which are not necessarily smooth.

Key concepts: Regular polygon, Mathematical optimization, Computer science, Convex optimization, Conic optimization, Convex analysis, Mathematics, Geometry

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Sequential optimality conditions for convex optimization — Research Paper | ScholarLens