Characteristics of semi-convex frontier optimization
From MaRDI portal
Publication:2790869
DOI10.1080/02331934.2014.994628zbMath1334.49074OpenAlexW2004028881MaRDI QIDQ2790869
Publication date: 8 March 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.994628
optimality conditionsnon-dominated pointsmulti-dimensional frontier analysisnon-smooth sensitivity analysissemi-convex frontier optimization
Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Optimality conditions for problems involving relations other than differential equations (49K21)
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms and software for total variation image reconstruction via first-order methods
- The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Characterizations of optimal solution sets of convex infinite programs
- Image sharpening by flows based on triple well potentials
- An economic production quantity model for defective items with trapezoidal type demand rate
- New optimality conditions for the semivectorial bilevel optimization problem
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Diversity Maximization Approach for Multiobjective Optimization
- Risk Attitudes and Decision Weights
- Sensitivity Analysis of Parameterized Variational Inequalities
- Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications
This page was built for publication: Characteristics of semi-convex frontier optimization