Pages that link to "Item:Q1403179"
From MaRDI portal
The following pages link to Steepest descent methods for multicriteria optimization. (Q1403179):
Displaying 50 items.
- Accelerated diagonal steepest descent method for unconstrained multiobjective optimization (Q2026727) (← links)
- Adjoint-assisted Pareto front tracing in aerodynamic and conjugate heat transfer shape optimization (Q2028109) (← links)
- Conditional gradient method for multiobjective optimization (Q2028470) (← links)
- An efficient descent method for locally Lipschitz multiobjective optimization problems (Q2031935) (← links)
- A strongly convergent proximal point method for vector optimization (Q2046562) (← links)
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems (Q2053032) (← links)
- A sequential quadratic programming method for constrained multi-objective optimization problems (Q2053082) (← links)
- Globally convergent Newton-type methods for multiobjective optimization (Q2082544) (← links)
- Adaptive trust region scheme for multi-objective optimization problem using Geršgorin circle theorem (Q2089175) (← links)
- Combined gradient methods for multiobjective optimization (Q2089219) (← links)
- Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach (Q2090124) (← links)
- Efficient fair principal component analysis (Q2102413) (← links)
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization (Q2114598) (← links)
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems (Q2132125) (← links)
- On inexact projected gradient methods for solving variable vector optimization problems (Q2138300) (← links)
- Expensive multi-objective optimization of electromagnetic mixing in a liquid metal (Q2139155) (← links)
- Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components (Q2139167) (← links)
- A study of Liu-Storey conjugate gradient methods for vector optimization (Q2139818) (← links)
- A quasi-Newton method with Wolfe line searches for multiobjective optimization (Q2159465) (← links)
- Intersection multi-objective optimization on signal setting and lane assignment (Q2159677) (← links)
- An adaptive direct multisearch method for black-box multi-objective optimization (Q2168631) (← links)
- A concave optimization-based approach for sparse multiobjective programming (Q2174899) (← links)
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization (Q2191796) (← links)
- Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds (Q2198534) (← links)
- Gradient based biobjective shape optimization to improve reliability and cost of ceramic components (Q2218896) (← links)
- Nonsmooth steepest descent method by proximal subdifferentials in Hilbert spaces (Q2247897) (← links)
- A trust-region method for unconstrained multiobjective problems with applications in satisficing processes (Q2251574) (← links)
- Quasi-Newton's method for multiobjective optimization (Q2252751) (← links)
- The self regulation problem as an inexact steepest descent method for multicriteria optimization (Q2256314) (← links)
- Nonmonotone line searches for unconstrained multiobjective optimization problems (Q2274871) (← links)
- A unifying convex analysis and switching system approach to consensus with undirected communication graphs (Q2288601) (← links)
- Multi-objective optimal design of feedback controls for dynamical systems with hybrid simple cell mapping algorithm (Q2299792) (← links)
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds (Q2302754) (← links)
- An accelerated augmented Lagrangian method for multi-criteria optimization problem (Q2338456) (← links)
- Approximate proximal methods in vector optimization (Q2370322) (← links)
- A subgradient method for multiobjective optimization (Q2377160) (← links)
- Inexact projected gradient method for vector optimization (Q2377166) (← links)
- Newton-like methods for efficient solutions in vector optimization (Q2377172) (← links)
- The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous (Q2417182) (← links)
- Proximal gradient methods for multiobjective optimization and their applications (Q2419509) (← links)
- On some properties and an application of the logarithmic barrier method (Q2467165) (← links)
- Box-constrained multi-objective optimization: A gradient-like method without ``a priori'' scalarization (Q2475812) (← links)
- Robust multiobjective optimization \& applications in portfolio optimization (Q2514713) (← links)
- Explicit gradient information in multiobjective optimization (Q2517803) (← links)
- Barzilai and Borwein's method for multiobjective optimization problems (Q2630749) (← links)
- Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization (Q2669595) (← links)
- An adaptive nonmonotone line search for multiobjective optimization problems (Q2669601) (← links)
- Efficient and sparse neural networks by pruning weights in a multiobjective learning approach (Q2669736) (← links)
- Convergence rates analysis of a multiobjective proximal gradient method (Q2688916) (← links)
- Memory gradient method for multiobjective optimization (Q2700431) (← links)
