Radargrammetric DSM Generation by Semi-Global Matching and Evaluation of Penalty Functions
Radargrammetry is a useful approach to generate Digital Surface Models (DSMs) and an alternative to InSAR techniques that are subject to temporal or atmospheric decorrelation.
Jinghui Wang +6 more
doaj +1 more source
A penalty function method based on smoothing lower order penalty function
The authors consider the following constrained optimization problem: \[ \min_x f(x)\text{ s.t. }g_i(x)\leq 0,\quad i= 1,2,\dots, m. \] For this problem, the authors introduce a penalty function method based on smoothing lower order penalty function. Some numerical examples are presented.
Xu, Xinsheng +3 more
openaire +1 more source
Addressing Dependent Data in Constrained Optimization Problems: A WOA-based Algorithm [PDF]
Optimization algorithms are widely used in various fields to find the best solution to a problem by minimizing or maximizing an objective function, subject to certain constraints.
Asieh Ghanbarpour +2 more
doaj +1 more source
Optimization of the Composition of Operating Units in Power Plants by Genetic Algorithm
One of the main tasks to be solved during planning the short-term modes of power systems is the optimization of compositions of operating units in power plants. In general case, it is a complex problem of nonlinear mathematical programming. Its solution,
Tulkin Gayibov +2 more
doaj +1 more source
Multidimensional Constrained Global Optimization in Domains with Computable Boundaries [PDF]
Multidimensional constrained global optimization problem with objective function under Lipschitz condition and constraints generating a feasible domain with computable boundaries is considered.
Grishagin, V., Israfilov, R.
core
In this article, we present new general results on existence of augmented Lagrange multipliers. We define a penalty function associated with an augmented Lagrangian, and prove that, under a certain growth assumption on the augmenting function, an ...
Dolgopolik, M. V.
core +1 more source
A Nonconvex Proximal Bundle Method for Nonsmooth Constrained Optimization
An implementable algorithm for solving nonsmooth nonconvex constrained optimization is proposed by combining bundle ideas, proximity control, and the exact penalty function.
Jie Shen, Fang-Fang Guo, Na Xu
doaj +1 more source
Robust Recursive Regulator for Systems Subject to Polytopic Uncertainties
We present a robust recursive framework for the regulation of discrete-time linear systems subject to polytopic uncertainties. Based on regularized least-squares with a penalty parameter, we formulate a convex optimization problem and weight the polytope
Jose Nuno A. D. Bueno +2 more
doaj +1 more source
A version of the penalty method with approximation of the epigraphs of auxiliary functions
A method for solving the convex programming problem, which is ideologically close to the known methods of external penalties, was proposed. The method uses auxiliary functions that are built on the general form of the penalty functions.
I.Ya. Zabotin, K.E. Kazaeva
doaj +1 more source
Cross talk penalty in two-channel wavelength conversion by four-wave mixing in a strained semiconductor optical amplifier [PDF]
A crucial function in wavelength-division multiplexed (WDM) all-optical networks is a wavelength converter. This function enhances wavelength routing options and improves network reconfigurability.
Geraghty, David F. +4 more
core

