Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry

DOI10.3934/NACO.2021020MaRDI QIDQ2167953zbMATH OpenOpenAlexFDO

Authors Kamran Jalilian, Kameleh Nasiri Pirbazari

Publication date 1 September 2022

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/naco.2021020

zbMATH Keywords

convex optimizationoptimality conditionsquality and customer satisfactionsale services

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Recommendations

• Optimality Conditions for Nonconvex Constrained Optimization Problems
• Optimality conditions in convex optimization revisited
• Optimality conditions for convex problems on intersections of non necessarily convex sets
• Necessary and sufficient KKT optimality conditions in non-convex optimization
• Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation

Cites work

• A robust optimal trajectory tracking control for systems with an input delay
• Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
• scientific article; zbMATH DE number 3167340 (Why is no real title available?)
• scientific article; zbMATH DE number 3737398 (Why is no real title available?)
• scientific article; zbMATH DE number 1113627 (Why is no real title available?)
• Nonlinear Programming
• On representations of the feasible set in convex optimization
• Optimality conditions for convex problems on intersections of non necessarily convex sets
• Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
• Optimality Conditions for Quasiconvex Programs
• Optimality conditions in convex optimization revisited
• Optimality conditions in optimization problems with convex feasible set using convexificators

Cited in

(3)

• Optimality and duality for robust optimization problems involving intersection of closed sets
• Optimality and duality for approximate solutions of multiobjective optimization problems involving intersection of closed sets
• Robust approximate optimality conditions for uncertain vector optimization problems and applications

This page was built for publication: Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry

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