Results 241 to 250 of about 231,170 (284)
Some of the next articles are maybe not open access.
Constrained Minimization Conditions
2008We turn now, in this final part of the book, to the study of minimization problems having constraints. We begin by studying in this chapter the necessary and sufficient conditions satisfied at solution points. These conditions, aside from their intrinsic value in characterizing solutions, define Lagrange multipliers and a certain Hessian matrix which ...
David G. Luenberger, Yinyu Ye
openaire +1 more source
General, Nested, and Constrained Wiberg Minimization
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2016Wiberg matrix factorization breaks a matrix Y into low-rank factors U and V by solving for V in closed form given U, linearizing V(U) about U, and iteratively minimizing ||Y - UV(U)||2 with respect to U only. This approach factors the matrix while effectively removing V from the minimization.
Strelow, Dennis +3 more
openaire +3 more sources
Constrained energy minimization and the target-constrained interference-minimized filter
Optical Engineering, 2003This PDF contains the communication "Constrained energy minimization and the target-constrained interference-minimized filter."
openaire +1 more source
Constrained Minimization: Equality Constraints
2003The minimization of a function whose variables must satisfy inequality constraints is considered here. Because of their nature, any number of inequality constraints can be imposed. To introduce the subject, conditions for locating a boundary minimal point of a function of one independent variable (see Section 2.2) are determined using the direct ...
openaire +1 more source
Constrained multiobjective distance minimization problems
Proceedings of the Genetic and Evolutionary Computation Conference, 2019Various distance minimization problems (DMPs) have been proposed to visualize the search behaviors of evolutionary multiobjective optimization (EMO) algorithms in solving many-objective problems, multiobjective multimodal problems, and dynamic multiobjective problems. Among those DMPs, only the box constraints are considered.
Yusuke Nojima +4 more
openaire +1 more source
Control of minimally constrained cobots
Journal of Robotic Systems, 2002AbstractCobots are devices which use computer‐oriented passive constraints to guide an end‐effector driven by a human. This synergistic union of human skill and robotic precision is desired in fields such as surgical robotics (our application area of interest) where the surgeon would prefer not to hand over control of a procedure to an autonomous robot.
Hodgson, Antony J., Emrich, Richard
openaire +1 more source
QoS-Constrained Power Minimization
2012In this chapter we discuss an algorithmic solution for the QoS-constrained power minimization problem, which was already introduced and discussed in Section 2.8. The following optimization framework is applicable to arbitrary systems of concave or convex standard interference functions \({\mathcal J}_k(p) = {\mathcal I}_k(\underline{p})\) (see Section ...
Martin Schubert, Holger Boche
openaire +1 more source
CONSTRAINED MULTIVARIATE LOSS FUNCTION MINIMIZATION
Quality Engineering, 2001Modifying Taguchi's one-dimensional quadratic loss function to a multidimensional form has attracted many researchers because a more accurate estimate of total loss due to variation from multiple quality targets would result. This article includes a..
Richard Suhr, Robert G. Batson
openaire +1 more source
Computing constrained energy-minimizing flows
2011 3rd International Conference on Computer Research and Development, 2011Conservative flows that minimize the kinetic energy have be linked to the problem of optimal transport, a field with numerous applications in many areas of mathematics, science and engineering ranging from probability theory, fluid dynamics meteorology, oceanography to antenna design, image registration and shape analysis among others.
Said Kerrache, Yasushi Nakauchi
openaire +1 more source
Constrained Minimization Using Powell’s Conjugacy Approach
SIAM Journal on Numerical Analysis, 1976We consider the problem of minimizing a function f of n real variables $x_1 , \cdots ,x_n $, subject to the provision that derivative information is not to be used in seeking the minimum. A number of methods exist for solving this problem and of these, several are based on the construction of conjugate or orthogonal search directions.
openaire +2 more sources

