A hyper-transformer model for controllable Pareto front learning with split feasibility constraints
From MaRDI portal
(Redirected from Publication:6608893)
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
- A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints
- A projection-fixed point method for a class of bilevel variational inequalities with split fixed point constraints
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Algorithms for the split variational inequality problem
- An MM Algorithm for Split Feasibility Problems
- Approximation by superpositions of a sigmoidal function
- Connectedness of the efficient solution set of a convex vector optimization in normed spaces
- Connectedness of the set of nondominated outcomes in multicriteria optimization
- Contractibility of the efficient set in strictly quasiconcave vector maximization
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
- scientific article; zbMATH DE number 734930 (Why is no real title available?)
- scientific article; zbMATH DE number 1145160 (Why is no real title available?)
- scientific article; zbMATH DE number 2226570 (Why is no real title available?)
- Image restorations using a modified relaxed inertial technique for generalized split feasibility problems
- Iterative oblique projection onto convex sets and the split feasibility problem
- Monotonic optimization: Problems and solution approaches
- Multicriteria Optimization
- Multilayer feedforward networks are universal approximators
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
- Optimization over the efficient set of a bicriteria convex programming problem
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
This page was built for publication: A hyper-transformer model for controllable Pareto front learning with split feasibility constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608893)
