An augmented Lagrangian algorithm for multi-objective optimization
From MaRDI portal
Publication:782908
DOI10.1007/s10589-020-00204-zzbMath1447.90055OpenAlexW3036250584MaRDI QIDQ782908
Publication date: 29 July 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00204-z
global convergenceaugmented Lagrangian methodconstrained multi-objective optimizationmulti-objective steepest descentPareto stationarity
Related Items (8)
Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems ⋮ A penalty decomposition approach for multi-objective cardinality-constrained optimization problems ⋮ An adaptive nonmonotone line search for multiobjective optimization problems ⋮ Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem ⋮ Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization ⋮ Pareto front approximation through a multi-objective augmented Lagrangian method ⋮ A memetic procedure for global multi-objective optimization ⋮ A limited memory quasi-Newton approach for multi-objective optimization
Uses Software
Cites Work
- An external penalty-type method for multicriteria
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
- Quasi-Newton methods for solving multiobjective optimization
- Multiobjective programming and penalty functions
- Epsilon-dominating solutions in mean-variance portfolio analysis
- A bicriterial optimization problem of antenna design
- Dominating sets for convex functions with some applications
- Steepest descent methods for multicriteria optimization.
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- Reduced Jacobian method
- An example comparing the standard and safeguarded augmented Lagrangian methods
- Quasi-Newton methods for multiobjective optimization problems
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
- A projected gradient method for vector optimization problems
- Gap-free computation of Pareto-points by quadratic scalarizations
- Quasi-Newton's method for multiobjective optimization
- Inexact projected gradient method for vector optimization
- An efficient sampling approach to multiobjective optimization
- Proximal gradient methods for multiobjective optimization and their applications
- Proper efficiency and the theory of vector maximization
- A Method for Constrained Multiobjective Optimization Based on SQP Techniques
- Bi-criteria optimization of open cross section of the thin-walled beams with flat flanges
- Direct Multisearch for Multiobjective Optimization
- On the convergence of the projected gradient method for vector optimization
- A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- Newton's Method for Multiobjective Optimization
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A barrier-type method for multiobjective optimization
- Proximal Methods in Vector Optimization
- Practical Augmented Lagrangian Methods for Constrained Optimization
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
- Benchmarking optimization software with performance profiles.
This page was built for publication: An augmented Lagrangian algorithm for multi-objective optimization
