On high-order model regularization for multiobjective optimization
From MaRDI portal
Publication:5038176
Recommendations
- On High-order Model Regularization for Constrained Optimization
- Conical regularization for multi-objective optimization problems
- Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A projected gradient method for vector optimization problems
- A quadratically convergent Newton method for vector optimization
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Complexity of gradient descent for multiobjective optimization
- Cubic regularization of Newton method and its global performance
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations
- Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
- Existence theorems in vector optimization
- Introduction to Shape Optimization
- Multiobjective optimization. Interactive and evolutionary approaches
- Newton's method for multiobjective optimization
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- Nonlinear multiobjective optimization
- Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds
- On High-order Model Regularization for Constrained Optimization
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- On the convergence of the projected gradient method for vector optimization
- Optimization over the efficient set
- Optimization over the efficient set of multi-objective convex optimal control problems
- Proper efficiency and the theory of vector maximization
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- Scalarizing vector optimization problems
- Steepest descent methods for multicriteria optimization.
- Testing Unconstrained Optimization Software
- The use of quadratic regularization with a cubic descent condition for unconstrained optimization
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Cited in
(6)- Conical regularization for multi-objective optimization problems
- On High-order Model Regularization for Constrained Optimization
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- Convergence rates analysis of a multiobjective proximal gradient method
- Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
- Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization
This page was built for publication: On high-order model regularization for multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038176)
