Pages that link to "Item:Q1091277"
From MaRDI portal
The following pages link to Scalarization of vector optimization problems (Q1091277):
Displaying 29 items.
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application (Q319989) (← links)
- Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions (Q369642) (← links)
- A steepest descent-like method for variable order vector optimization problems (Q467437) (← links)
- A subgradient-like algorithm for solving vector convex inequalities (Q467438) (← links)
- Stability and scalarization in vector optimization using improvement sets (Q495731) (← links)
- Scalarization and pointwise well-posedness in vector optimization problems (Q537955) (← links)
- Generating the weakly efficient set of nonconvex multiobjective problems (Q934803) (← links)
- Cones admitting strictly positive functionals and scalarization of some vector optimization problems (Q1379957) (← links)
- Stability and scalarization of weak efficient, efficient and Henig proper efficient sets using generalized quasiconvexities (Q1935278) (← links)
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems (Q1990434) (← links)
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems (Q2053032) (← links)
- On inexact projected gradient methods for solving variable vector optimization problems (Q2138300) (← links)
- Nonmonotone line searches for unconstrained multiobjective optimization problems (Q2274871) (← links)
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398) (← links)
- An accelerated augmented Lagrangian method for multi-criteria optimization problem (Q2338456) (← links)
- Inexact projected gradient method for vector optimization (Q2377166) (← links)
- A new duality approach to solving concave vector maximization problems (Q2433928) (← links)
- On the choice of parameters for the weighting method in vector optimization (Q2467161) (← links)
- On some properties and an application of the logarithmic barrier method (Q2467165) (← links)
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION (Q2785241) (← links)
- On the convergence of the projected gradient method for vector optimization (Q3112500) (← links)
- (Q4039214) (← links)
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
- A steepest descent-like method for vector optimization problems with variable domination structure (Q5052577) (← links)
- A barrier-type method for multiobjective optimization (Q5151514) (← links)
- Efficient solutions in generalized linear vector optimization (Q5379436) (← links)
- On quadratic scalarization of vector optimization problems in Banach spaces (Q5418081) (← links)
- Contractibility of efficient point sets in normed spaces (Q5750726) (← links)
- MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS (Q6196941) (← links)
