The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Newton's Method for Multiobjective Optimization
Abstract
We propose an extension of Newton's method for unconstrained multiobjective optimization (multicriteria optimization). This method does not use a priori chosen weighting factors or any other form of a priori ranking or ordering information for the different objective functions. Newton's direction at each iterate is obtained by minimizing the max-ordering scalarization of the variations on the quadratic approximations of the objective functions. The objective functions are assumed to be twice continuously differentiable and locally strongly convex. Under these hypotheses, the method, as in the classical case, is locally superlinear convergent to optimal points. Again as in the scalar case, if the second derivatives are Lipschitz continuous, the rate of convergence is quadratic. Our convergence analysis uses a Kantorovich-like technique. As a byproduct, existence of optima is obtained under semilocal assumptions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Das, I., & Dennis, J. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496307510 · Cited by 2,654
Theory of Multiobjective Optimization
(1985) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(09)x6017-0 · Cited by 1,508
Combining Convergence and Diversity in Evolutionary Multiobjective Optimization
Laumanns, M., Thiele, L., Deb, K., & Zitzler, E. (2002) · Evolutionary Computation · doi:10.1162/106365602760234108 · Cited by 1,487
Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
Deb, K. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.3.205 · Cited by 1,451
Proper efficiency and the theory of vector maximization
Geoffrion, A. M. (1968) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(68)90201-1 · Cited by 1,366
Optimality and non-scalar-valued performance criteria
Zadeh, L. (1963) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1963.1105511 · Cited by 1,210
Das, I., & Dennis, J. E. (1997) · Structural Optimization · doi:10.1007/bf01197559 · Cited by 1,208
Dennis, J. E., & Schnabel, R. B. (1996) · Cited by 949
Adaptive weighted-sum method for bi-objective optimization: Pareto front generation
Kim, I. Y., & de Weck, O. L. (2005) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-004-0465-1 · Cited by 687
Cited by
A research survey: review of flexible job shop scheduling techniques
Chaudhry, I. A., & Khan, A. A. (2016) · International Transactions in Operational Research · doi:10.1111/itor.12199 · Cited by 439
Review of numerical optimization techniques for meta-device design [Invited]
Campbell, S. D., Sell, D., Jenkins, R. P., Whiting, E. B., Fan, J. A., & Werner, D. H. (2019) · Optical Materials Express · doi:10.1364/ome.9.001842 · Cited by 322
Metadata
- Authors
- Fliege, J., Drummond, L. M. G., & Svaiter, B. F.
- Venue
- SIAM Journal on Optimization
- Published
- 2009-01
- Volume
- 20
- Issue
- 2
- Pages
- 602-626
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2004586020
- Cited by
- 409
- References
- 16
- FWCI
- 10.18
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.