Articles with "non convex" as a keyword



Mathematical analysis of a non‐convex optimal control problem for age‐structured mosquito populations

Sign Up to like & get
recommendations!
Published in 2024 at "Mathematical Methods in the Applied Sciences"

DOI: 10.1002/mma.10389

Abstract: We present a rigorous mathematical analysis of a non‐convex optimal control problem for mosquito populations. The nonlinear model for the dynamics of the mosquito population takes in consideration the iterations among the immature (aquatic) subpopulation,… read more here.

Keywords: analysis non; control; optimal control; mathematical analysis ... See more keywords
Photo by nci from unsplash

A dictionary‐based graph‐cut algorithm for MRI reconstruction

Sign Up to like & get
recommendations!
Published in 2020 at "NMR in Biomedicine"

DOI: 10.1002/nbm.4344

Abstract: Compressive sensing (CS)‐based image reconstruction methods have proposed random undersampling schemes that produce incoherent, noise‐like aliasing artifacts, which are easier to remove. The denoising process is critically assisted by imposing sparsity‐enforcing priors. Sparsity is known… read more here.

Keywords: reconstruction; based graph; graph cut; cut algorithm ... See more keywords

Two-Phase Solutions for One-Dimensional Non-convex Elastodynamics

Sign Up to like & get
recommendations!
Published in 2018 at "Archive for Rational Mechanics and Analysis"

DOI: 10.1007/s00205-018-1326-1

Abstract: We explore the local existence and properties of classical weak solutions to the initial-boundary value problem for a class of quasilinear equations of elastodynamics in one space dimension with a non-convex stored-energy function, a model… read more here.

Keywords: phase; weak solutions; non convex; problem ... See more keywords

Feature selection with MCP$$^2$$2 regularization

Sign Up to like & get
recommendations!
Published in 2019 at "Neural Computing and Applications"

DOI: 10.1007/s00521-018-3500-7

Abstract: Feature selection, as a fundamental component of building robust models, plays an important role in many machine learning and data mining tasks. Recently, with the development of sparsity research, both theoretical and empirical studies have… read more here.

Keywords: selection mcp; feature selection; non convex; regularization ... See more keywords
Photo from archive.org

A Guide on Solving Non-convex Consumption-Saving Models

Sign Up to like & get
recommendations!
Published in 2020 at "Computational Economics"

DOI: 10.1007/s10614-020-10045-x

Abstract: Consumption-saving models with adjustment costs or discrete choices are typically hard to solve numerically due to the presence of non-convexities. This paper provides a number of tools to speed up the solution of such models.… read more here.

Keywords: guide solving; saving models; non convex; consumption ... See more keywords

Algorithm for Overcoming the Curse of Dimensionality For Time-Dependent Non-convex Hamilton–Jacobi Equations Arising From Optimal Control and Differential Games Problems

Sign Up to like & get
recommendations!
Published in 2017 at "Journal of Scientific Computing"

DOI: 10.1007/s10915-017-0436-5

Abstract: In this paper we develop a parallel method for solving possibly non-convex time-dependent Hamilton–Jacobi equations arising from optimal control and differential game problems. The subproblems are independent so they can be implemented in an embarrassingly… read more here.

Keywords: curse dimensionality; control; time; jacobi equations ... See more keywords

Gradient Surfing: A New Deterministic Approach for Low-Dimensional Global Optimization

Sign Up to like & get
recommendations!
Published in 2019 at "Journal of Optimization Theory and Applications"

DOI: 10.1007/s10957-018-1397-z

Abstract: We describe a novel global optimization technique which utilizes global minima basins of attraction in order to quickly converge to a global minima. A key to the proposed method is the “steeper goes deeper” heuristic:… read more here.

Keywords: gradient surfing; global optimization; surfing new; minima ... See more keywords

An Equivalence Theorem on Minimum Sheltering Speed for Non-convex Habitats

Sign Up to like & get
recommendations!
Published in 2018 at "Set-Valued and Variational Analysis"

DOI: 10.1007/s11228-016-0396-1

Abstract: The paper is devoted to a new family of variational problems for differential inclusions, motivated by the protection of human and wildlife habitats when an invasive environmental disaster occurs. Indeed, the mathematical model consists of… read more here.

Keywords: convex habitats; theorem minimum; speed; non convex ... See more keywords

Augmented Lagrangian alternating direction method for low-rank minimization via non-convex approximation

Sign Up to like & get
recommendations!
Published in 2017 at "Signal, Image and Video Processing"

DOI: 10.1007/s11760-017-1084-9

Abstract: This paper concerns the low-rank minimization problems which consist of finding a matrix of minimum rank subject to linear constraints. Many existing approaches, which used the nuclear norm as a convex surrogate of the rank… read more here.

Keywords: rank minimization; non convex; low rank; augmented lagrangian ... See more keywords

Optimality and duality for vector optimization problem with non-convex feasible set

Sign Up to like & get
recommendations!
Published in 2019 at "OPSEARCH"

DOI: 10.1007/s12597-019-00401-3

Abstract: The Karush–Kuhn–Tucker (KKT) optimality conditions are necessary and sufficient for a convex programming problem under suitable constraint qualification. Recently, several papers (Dutta and Lalitha in Optim Lett 7(2):221–229, 2013 ; Lasserre in Optim Lett 4(1):1–5,… read more here.

Keywords: convexity; problem; non convex; feasible set ... See more keywords
Photo from academic.microsoft.com

Algebraic vertices of non-convex polyhedra

Sign Up to like & get
recommendations!
Published in 2017 at "Advances in Mathematics"

DOI: 10.1016/j.aim.2016.12.026

Abstract: Abstract In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that… read more here.

Keywords: algebraic vertex; algebraic vertices; polyhedron; vertices non ... See more keywords