Weighted Multidimensional Search and Its Application to Convex Optimization

DOI10.1137/S0097539792241928MaRDI QIDQ4875446zbMATH OpenFDO

Authors Richa Agarwala, David Fernández-Baca

Publication date 24 April 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539792241928

zbMATH Keywords

multidimensional searchoptimum subgraph problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Multiweight optimization in optimal bounding ellipsoid algorithms
• A weighting subgradient algorithm for multiobjective optimization
• An approximation algorithm for convex multi-objective programming problems
• An algorithm for approximate multiparametric convex programming
• On convex vector optimization problems with possibilistic weights
• A nonlinear weights selection in weighted sum for convex multiobjective optimization
• Convex projection and convex multi-objective optimization
• scientific article; zbMATH DE number 1547881
• Optimizing over the properly efficient set of convex multi-objective optimization problems
• The power of the weighted sum scalarization for approximating multiobjective optimization problems

Cited in

(5)

• Decomposable multi-parameter matroid optimization problems.
• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
• Weighted A^* search - unifying view and application
• Optimal parametric search on graphs of bounded tree-width
• Search method for the weighting matrix of the weighted multivariable circle criterion

This page was built for publication: Weighted Multidimensional Search and Its Application to Convex Optimization

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