University of Jyväskylä | JYX Digital Repository

  • English  | Give feedback |
    • suomi
    • English
 
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
View Item 
  • JYX
  • Opinnäytteet
  • Väitöskirjat
  • View Item
JYX > Opinnäytteet > Väitöskirjat > View Item

Approximation through interpolation in nonconvex multiobjective optimization

Thumbnail
View/Open
2.3 Mb

Downloads:  
Show download detailsHide download details  
Published in
Jyväskylä studies in computing
Authors
Hartikainen, Markus
Date
2011
Discipline
Tietotekniikka

 
Publisher
University of Jyväskylä
ISBN
978-951-39-4536-7
ISSN Search the Publication Forum
1456-5390
Keywords
multiobjective optimization interactive decision making computational cost Pareto front approximation surrogate problem Pareto optimality PAINT optimointi atk-ohjelmat yhteissuunnittelu vuorovaikutteisuus tietokoneohjelmat ohjelmistot
URI

http://urn.fi/URN:ISBN:978-951-39-4536-7

Metadata
Show full item record
Collections
  • Väitöskirjat [3178]

Related items

Showing items with similar title or keywords.

  • Approximation method for computationally expensive nonconvex multiobjective optimization problems 

    Haanpää, Tomi (University of Jyväskylä, 2012)
  • On solving computationally expensive multiobjective optimization problems with interactive methods 

    Ojalehto, Vesa (University of Jyväskylä, 2014)
  • A survey on handling computationally expensive multiobjective optimization problems using surrogates: non-nature inspired methods 

    Tabatabaei, Mohammad; Hakanen, Jussi; Hartikainen, Markus; Miettinen, Kaisa; Sindhya, Karthik (Springer Berlin Heidelberg; International Society for Structural and Multidisciplinary Optimization, 2015)
    Computationally expensive multiobjective optimization problems arise, e.g. in many engineering applications, where several conflicting objectives are to be optimized simultaneously while satisfying constraints. In many ...
  • Handling expensive multiobjective optimization problems with evolutionary algorithms 

    Chugh, Tinkle (University of Jyväskylä, 2017)
    Multiobjective optimization problems (MOPs) with a large number of conflicting objectives are often encountered in industry. Moreover, these problem typically involve expensive evaluations (e.g. time consuming simulations ...
  • DESDEO: The Modular and Open Source Framework for Interactive Multiobjective Optimization 

    Misitano, Giovanni; Saini, Bhupinder Singh; Afsar, Bekir; Shavazipour, Babooshka; Miettinen Kaisa (Institute of Electrical and Electronics Engineers (IEEE), 2021)
    Interactive multiobjective optimization methods incorporate preferences from a human decision maker in the optimization process iteratively. This allows the decision maker to focus on a subset of solutions, learn about the ...
  • Browse materials
  • Browse materials
  • Articles
  • Conferences and seminars
  • Electronic books
  • Historical maps
  • Journals
  • Tunes and musical notes
  • Photographs
  • Presentations and posters
  • Publication series
  • Research reports
  • Research data
  • Study materials
  • Theses

Browse

All of JYXCollection listBy Issue DateAuthorsSubjectsPublished inDepartmentDiscipline

My Account

Login

Statistics

View Usage Statistics
  • How to publish in JYX?
  • Self-archiving
  • Publish Your Thesis Online
  • Publishing Your Dissertation
  • Publication services

Open Science at the JYU
 
Data Protection Description

Accessibility Statement

Unless otherwise specified, publicly available JYX metadata (excluding abstracts) may be freely reused under the CC0 waiver.
Open Science Centre