Results 51 to 60 of about 22,374 (199)
An Adaptive Primal-Dual Framework for Nonsmooth Convex Minimization
, 2018 We propose a new self-adaptive, double-loop smoothing algorithm to solve composite, nonsmooth, and constrained convex optimization problems. Our algorithm is based on Nesterov's smoothing technique via general Bregman distance functions.
Alacaoglu, Ahmet +3 more
core +1 more source
Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation
Computer Graphics Forum, EarlyView.Abstract We present a highly efficient and robust method for free boundary injective parameterization of disk‐like triangle meshes with low isometric distortion. Harmonic function–based approaches, grounded in a strong mathematical framework, are widely employed.
G. Fargion, O. Weber
wiley +1 more source
Computer Graphics Forum, EarlyView.Abstract We introduce mixed super‐circles, a position‐curvature formulation of the original dynamic 2D super‐helix model. Compared to the latter, purely curvature‐based model – the so‐called chained formulation –, the mixed formulation that we propose here drastically reduces the algorithmic complexity of the solving scheme – from quadratic to quasi ...
Emile Hohnadel +2 more
wiley +1 more source
Random Carbon Tax Policy and Investment Into Emission Abatement Technologies
Mathematical Finance, EarlyView.ABSTRACT We analyze the problem of a profit‐maximizing electricity producer, subject to carbon taxes, who decides on investments into CO2$\rm CO_2$ abatement technologies. We assume that the carbon tax policy is random and that the investment in the abatement technology is divisible, irreversible, and subject to transaction costs.
Katia Colaneri +2 more
wiley +1 more source
International Transactions in Operational Research, Volume 33, Issue 5, Page 3128-3157, September 2026.Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley +1 more source
On a Nonsmooth Vector Optimization Problem with Generalized Cone Invexity
Abstract and Applied Analysis, 2012 By using Clarke’s generalized gradients we consider a nonsmooth vector optimization problem with cone constraints and introduce some generalized cone-invex functions called K-α-generalized invex, K-α-nonsmooth invex, and other related functions.
Hehua Jiao, Sanyang Liu
doaj +1 more source
Vector Field‐Based Collision‐Free Navigation in Tunnel‐Like Environments
Journal of Field Robotics, Volume 43, Issue 3, Page 2521-2547, May 2026.ABSTRACT Tunnel‐like environments, renowned for their vast scale, confined spaces, and limited visibility, present significant challenges for autonomous robot navigation. This study addresses the critical issue of guiding robots through such environments while ensuring collision‐free navigation and maintaining a specified safety margin from both tunnel
Bao Jianjun +5 more
wiley +1 more source
Advanced Intelligent Discovery, Volume 2, Issue 2, April 2026.This work presents a novel generative artificial intelligence (AI) framework for inverse alloy design through operations (optimization and diffusion) within learned compact latent space from variational autoencoder (VAE). The proposed work addresses challenges of limited data, nonuniqueness solutions, and high‐dimensional spaces.
Mohammad Abu‐Mualla +4 more
wiley +1 more source
Abstract and Applied Analysis, 2013 We deal with complementarity problems over second-order cones. The complementarity problem is an important class of problems in the real world and involves many optimization problems.
Yasushi Narushima +2 more
doaj +1 more source
Journal of Inequalities and Applications, 2019 To solve large-scale unconstrained optimization problems, a modified PRP conjugate gradient algorithm is proposed and is found to be interesting because it combines the steepest descent algorithm with the conjugate gradient method and successfully fully ...
Gonglin Yuan, Tingting Li, Wujie Hu
doaj +1 more source