Related papers: Analytic Center Cutting Plane Methods for Variatio…
We propose several adaptive algorithmic methods for problems of non-smooth convex optimization. The first of them is based on a special artificial inexactness. Namely, the concept of inexact ($ \delta, \Delta, L$)-model of objective…
This paper considers the stochastic convex composite optimization problem and presents multi-cut stochastic approximation (SA) methods for solving it, whose models in expectation overestimate its objective function. The multi-cut model…
This paper proposes novel algorithm for non-convex multimodal constrained optimisation problems. It is based on sequential solving restrictions of problem to sections of feasible set by random subspaces (in general, manifolds) of low…
In this paper we solve the problem of analytic classification of plane curves singularities with two branches by presenting their normal forms. This is accomplished by means of a new analytic invariant that relates vectors in the tangent…
We introduce the arithmetic width of a convex body, defined as the number of distinct values a linear functional attains on the lattice points within the body. Arithmetic width refines lattice width by detecting gaps in the lattice point…
This paper introduces a new type of regression methodology named as Convex-Area-Wise Linear Regression(CALR), which separates given datasets by disjoint convex areas and fits different linear regression models for different areas. This…
Geodesic models are known as an efficient tool for solving various image segmentation problems. Most of existing approaches only exploit local pointwise image features to track geodesic paths for delineating the objective boundaries.…
Quadratic constrained quadratic programming problems often occur in various fields such as engineering practice, management science, and network communication. This article mainly studies a non convex quadratic programming problem with…
Outer approximation methods have long been employed to tackle a variety of optimization problems, including linear programming, in the 1960s, and continue to be effective for solving variational inequalities, general convex problems, as…
Variational inequalities, formulated on unknown dependent convex sets, are called quasi-variational inequalities (QVI). This paper is concerned with the abstract approach to a class of parabolic QVIs arising in many biochemical/mechanical…
We study a cutting-plane method for semidefinite optimization problems (SDOs), and supply a proof of the method's convergence, under a boundedness assumption. By relating the method's rate of convergence to an initial outer approximation's…
An effective method to obtain exact analytical solutions of equations describing the coherent dynamics of multilevel systems is presented. The method is based on the usage of orthogonal polynomials, integral transforms and their discrete…
We present a successive constraint approach that makes it possible to cheaply solve large-scale linear matrix inequalities for a large number of parameter values. The efficiency of our method is made possible by an offline/online…
Change-plane analysis is a pivotal tool for identifying subgroups within a heterogeneous population, yet it presents challenges when applied to functional data. In this paper, we consider a change-plane model within the framework of…
We show that it is possible to obtain an $O(\epsilon^{-4/3})$ expected runtime --- including computational cost --- for finding $\epsilon$-stationary points of smooth nonconvex functions using cutting plane methods. This improves on the…
In this paper we present applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. According to variational approach in the general case we have the solution as a…
The aim of this paper is to present a new method of approximation of planar data set using only arcs or segments. The first problem we are trying to solve is the following: the CNC machines can work only with simple curves (arcs or…
A multiscale numerical method is proposed for the solution of semi-linear elliptic stochastic partial differential equations with localized uncertainties and non-linearities, the uncertainties being modeled by a set of random parameters. It…
In this article, we derive an iterative scheme through a quasi-Newton technique to capture robust weakly efficient points of uncertain multiobjective optimization problems under the upper set less relation. It is assumed that the set of…
We derive analytic formulas for the alternating projection method applied to the cone $\mathbb{S}^n_+$ of positive semidefinite matrices and an affine subspace. More precisely, we find recursive relations on parameters representing a…