Results 51 to 60 of about 1,344 (121)
Generalized semi-infinite programming: Numerical aspects [PDF]
Generalized semi-infinite optimization problems (GSIP) are considered. It is investigated how the numerical methods for standard semi-infinite programming (SIP) can be extended to GSIP. Newton methods can be extended immediately.
Still, G.J.
core +2 more sources
A Note on the Convergence of ADMM for Linearly Constrained Convex Optimization Problems
This note serves two purposes. Firstly, we construct a counterexample to show that the statement on the convergence of the alternating direction method of multipliers (ADMM) for solving linearly constrained convex optimization problems in a highly ...
Chen, Liang, Sun, Defeng, Toh, Kim-Chuan
core +1 more source
NUMERICAL ALGORITHM FOR SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF LOCAL VARIATIONS
In this article we gave a description of an algorithm of the method of local variations for numerical solution of problems of optimal control. We have developed a program based on the method of local variations to solve the optimal control problems with ...
I. Grigoryev, S. Mustafina
semanticscholar +1 more source
We present O(n2)an integer linear formulation that uses the so-called “distance variables” to solve the quadratic assignment problem (QAP). The formulation performs particularly well for problems with Manhattan distance matrices.
Serigne Gueye, Philippe Michelon
doaj +1 more source
Methods of tropical optimization in rating alternatives based on pairwise comparisons
We apply methods of tropical optimization to handle problems of rating alternatives on the basis of the log-Chebyshev approximation of pairwise comparison matrices.
A Farkas +9 more
core +1 more source
It is of strong theoretical significance and application prospects to explore three-block nonconvex optimization with nonseparable structure, which are often modeled for many problems in machine learning, statistics, and image and signal processing.
Zhao Ying, Lan Heng-you, Xu Hai-yang
doaj +1 more source
Uncontrolled inexact information within bundle methods
We consider convex non-smooth optimization problems where additional information with uncontrolled accuracy is readily available. It is often the case when the objective function is itself the output of an optimization solver, as for large-scale energy ...
Jérôme Malick +2 more
doaj +1 more source
In this paper, a modified Rivaie-Mohd-Ismail-Leong (RMIL) conjugate gradient-based projection algorithm for constrained nonlinear equations is proposed, which integrates projection techniques and line search approaches to enhance solution accuracy and ...
Wang Kai, Li Dandan, Wang Songhua
doaj +1 more source
Best Approximation from the Kuhn-Tucker Set of Composite Monotone Inclusions [PDF]
Kuhn-Tucker points play a fundamental role in the analysis and the numerical solution of monotone inclusion problems, providing in particular both primal and dual solutions.
Abdullah Alotaibi +3 more
core
Second Derivative Free Eighteenth Order Convergent Method for Solving Non-Linear Equations
In this paper, the Eighteenth Order Convergent Method (EOCM) developed by Vatti et.al is considered and this method is further studied without the presence of second derivative.
V. B. Vatti, R. Sri, M. S. K. Mylapalli
semanticscholar +1 more source

