Convergence analysis of a norm minimization-based convex vector optimization algorithm
From MaRDI portal
Publication:6587338
DOI10.1137/23M1574580MaRDI QIDQ6587338FDOQ6587338
Authors: Çağın Ararat, Firdevs Ulus, Muhammad Umer
Publication date: 14 August 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Recommendations
- A norm minimization-based convex vector optimization algorithm
- Primal and dual approximation algorithms for convex vector optimization problems
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
Hausdorff distanceapproximation algorithmconvergence ratemultiobjective optimizationconvex vector optimizationconvex compact set
Convex programming (90C25) Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29)
Cites Work
- Vector Optimization with Infimum and Supremum
- Title not available (Why is that?)
- Convex Analysis
- Theory of multiobjective optimization
- Graph implementations for nonsmooth convex programs
- Infinite dimensional analysis. A hitchhiker's guide.
- A class of adaptive algorithms for approximating convex bodies by polyhedra
- Scalarizing vector optimization problems
- Interactive decision maps. Approximation and visualization of Pareto frontier
- A revised simplex method for linear multiple objective programs
- Constrained optimization using multiple objective programming
- An algorithm for calculating the set of superhedging portfolios in markets with transaction costs
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Title not available (Why is that?)
- Newton's method for multiobjective optimization
- Scalarization in vector optimization
- Title not available (Why is that?)
- Solving multiobjective mixed integer convex optimization problems
- Unbiased approximation in multicriteria optimization
- Motzkin decomposition of closed convex sets via truncation
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Finding all maximal efficient faces in multiobjective linear programming
- The vector linear program solver \textit{Bensolve} -- notes on theoretical background
- Benson type algorithms for linear vector optimization and applications
- Frontiers of Stochastically Nondominated Portfolios
- Primal and dual approximation algorithms for convex vector optimization problems
- An approximation algorithm for convex multi-objective programming problems
- Polyhedral approximation of convex compact bodies by filling methods
- A parametric simplex algorithm for linear vector optimization problems
- Convex projection and convex multi-objective optimization
- Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- A Benson type algorithm for nonconvex multiobjective programming problems
- A numerical method for the approximation of reachable sets of linear control systems
- Time consistency of the mean-risk problem
- Outer approximation algorithms for convex vector optimization problems
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- On generalized trade-off directions in nonconvex multiobjective optimization
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle
- Title not available (Why is that?)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Distance Between Sets - A survey
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- A norm minimization-based convex vector optimization algorithm
- Computation of Systemic Risk Measures: A Mixed-Integer Programming Approach
- Technical note -- Characterizing and computing the set of Nash equilibria via vector optimization
This page was built for publication: Convergence analysis of a norm minimization-based convex vector optimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587338)