scientific article; zbMATH DE number 3932811
From MaRDI portal
Publication:3707780
Recommendations
Cited in
(12)- An algorithm for linearly constrained convex nondifferentiable minimization problems
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems
- A concave optimization-based approach for sparse multiobjective programming
- A gradient like algorithm for linearly constrained multi-objective optimization
- scientific article; zbMATH DE number 4130199 (Why is no real title available?)
- scientific article; zbMATH DE number 3887449 (Why is no real title available?)
- scientific article; zbMATH DE number 3900525 (Why is no real title available?)
- scientific article; zbMATH DE number 16326 (Why is no real title available?)
- scientific article; zbMATH DE number 1271383 (Why is no real title available?)
- scientific article; zbMATH DE number 503306 (Why is no real title available?)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707780)