Optimality condition and complexity of order-value optimization problems and low order-value optimization problems

DOI10.1007/s10898-017-0520-2zbMath1373.90083OpenAlexW2605617452MaRDI QIDQ1679497

Zhongyi Jiang, Qiying Hu, Xiao Jin Zheng

Publication date: 9 November 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0520-2

zbMATH Keywords

NP-hardcomplexity theoryKKT conditionslow order-value optimization problemorder-value optimization problemsmooth reformulation

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11) Quadratic programming (90C20)

Related Items (1)

A robust method based on LOVO functions for solving least squares problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low order-value approach for solving var-constrained optimization problems
• Continuous optimization methods for structure alignments
• Low order-value optimization and applications
• Order-value optimization: formulation and solution by means of a primal Cauchy method
• Generalized order-value optimization
• Nonlinear-programming reformulation of the order-value optimization problem
• Trust-region superposition methods for protein alignment
• On the global minimization of the value-at-risk
• Sparse Approximate Solutions to Linear Systems
• Nonlinear Programming
• Robust Statistics

This page was built for publication: Optimality condition and complexity of order-value optimization problems and low order-value optimization problems