Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation-Reference-Cited by-同舟云学术

Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation

Published:2018-02 Issue:1 Volume:265 Page:19-25
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Chieu N.H.,Jeyakumar V.,Li G.,Mohebi H.

Funder

Australian Research Council

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference22 articles.

1. Perturbation analysis of optimization problems;Bonnans,2000

2. Convex optimization;Boyd,2004

3. Best approximation in inner product spaces;Deutsch,2000

4. Fenchel duality and the strong conical hull intersection property;Deutsch;Journal of Optimization Theory and Applications,1999

5. The role of conical hull intersection property in convex optimization and approximation;Deutsch,1998

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling;Journal of Global Optimization;2024-07-20

2. A Sparse Neural Network-Based Control Method for Saturated Nonlinear Affine Systems;Actuators;2024-05-29

3. Optimality and Duality for Robust Optimization Problems Involving Intersection of Closed Sets;Journal of Optimization Theory and Applications;2024-05-28

4. Piecewise SOS-convex moment optimization and applications via exact semi-definite programs;EURO Journal on Computational Optimization;2024

5. Convergences for robust bilevel polynomial programmes with applications;Optimization Methods and Software;2023-05-19