A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach
2005
INFORMS journal on computing
Preserved Fulltext
W e introduce a cutting-plane, analytic-center algorithm for strongly monotone variational inequalities (VIs). The approach extends that of Goffin et al. (1997) and Denault and Goffin (1999) . ...
Our approach uses quadratic, ellipsoidal cuts, based on the symmetrized Jacobian of the VI. ...
to by the acronym ACCPM, for analytic center cutting plane method. ...
doi:10.1287/ijoc.1030.0065
fatcat:2vgshvxekfhs3e5sgtyd5dfsca
Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach
2004
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We extend in two directions the Analytic Center, Cutting Plane Method for Variational Inequalities with quadratic cuts, ACCPM-VI(quadratic cuts), introduced by Denault and Go n in 1998. ...
First, we deÿne a primal-dual method to ÿnd the analytic center at each iteration. ...
Review of cutting plane methods for variational inequalities The ACCPM-VI algorithms (there are many versions) all use, in one way or another, the Analytic Center Cutting Plane Method, pioneered by Go ...
doi:10.1016/s0305-0548(03)00032-7
fatcat:kjvtacxq6jejxb2s6qlbzh5psm
On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities
[chapter]
1999
Computational Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present an algorithm for variational inequalities V I(F, Y ) that uses a primal-dual version of the Analytic Center Cutting Plane Method. ...
Each computation of a new analytic center requires at most four Newton iterations, in theory, and in practice one or sometimes two. ...
The notation O * indicates that lower order terms are ignored 4. A formal proof of this would require a very significant and lengthy rewriting of the proofs of [12] and [13] . ...
doi:10.1007/978-1-4615-5197-3_8
fatcat:7lnxszbsnnfa7pct3bbh7vkmra
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
1999
SIAM Journal on Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we consider a new analytic center cutting plane method in a projective space. ...
We prove the e ciency estimates for the general scheme and show that these results can be used in the analysis of a feasibility problem, the variational inequality problem and the problem of constrained ...
B ueler worked out the computations on the small example of Section 4. We thank him for letting us make use of his results. We are also grateful for his comments on the paper. ...
doi:10.1137/s1052623497324813
fatcat:msqvpgjy7jgf5jkz6yxt4xscuu
Solving variational inequalities defined on a domain with infinitely many linear constraints
2007
Computational optimization and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
A discretization method and an analytic center based inexact cutting plane method are proposed. Under proper assumptions, the convergence results for both methods are given. ...
We study a variational inequality problem whose domain is defined by infinitely many linear inequalities. ...
Recently, the authors in [8, 24] presented an analytic center based cutting plane method for solving a general semi-infinite variational inequality problem. ...
doi:10.1007/s10589-007-9013-4
fatcat:dp4mcxsjhjditf5q7pp5q3d3ki
A Lagrangian dual method for solving variational inequalities
2002
Mathematical Inequalities & Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
An analytic center quadratic cut method for strongly monotone variational inequality problems is suggested in Lüthi and Büeler 12]. ...
Mathematics subject classification Nesterov and Vial ( 15]) introduced a homogeneous analytic center cutting plane method (HACCPM) which solves monotone VIPs in a conic setting and pseudopolynomial-time ...
;γ k x k =µ k; 1 i 1 ) i = 1 : : : m + 2n:
A LAGRANGIAN DUAL METHOD FOR SOLVING VARIATIONAL INEQUALITIES 599 For example, the differential version of KKT theorem for problem min f (x) subject to ...
doi:10.7153/mia-05-60
fatcat:2zjfh73flrdjvfqxfl4pexoq3i
New Method to Enforce Inequality Constraints of Entry Trajectory
2012
Journal of Guidance Control and Dynamics
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
the need to solve a complex optimiz- ation problem in real time and 2) successfully flight testing the approach through an experimental application to a cutting-edge quadrotor helicopter UAV. ...
., “A Direct Method for Approach and Landing Trajectory Reshaping with Failure Effect Estimation,” AIAA Paper 2004-4772, Aug. 2004.
[12] Leavitt, J. A., and Mease, K. ...
doi:10.2514/1.56937
fatcat:svuglbxwqbhqddvsyjvik35fna
Shallow, deep and very deep cuts in the analytic center cutting plane method
1999
Mathematical programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The analytic center cutting plane (ACCPM) methods aims to solve nondi erentiable convex problems. ...
The primal framework leads to a simple analysis of the potential variation, which shows that the inequality needed for convergence of the algorithm is in fact attained at the rst iterate of the feasibility ...
The analytic center cutting plane method chooses as query point an approximate analytic center of F D . ...
doi:10.1007/s10107980011a
fatcat:jvtj64uqtnezbnh5phgfjpcsx4
Finsler interpolation inequalities
2009
Calculus of Variations and Partial Differential Equations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
comparison, optimal transport, curvature-dimension condition, concentration of measure. ‡ Partly supported by the JSPS fellowship for research abroad. ...
Among applications, we establish the equivalence between Sturm, Lott and Villani's curvature-dimension condition and a certain lower Ricci curvature bound. ...
If r(v) < ∞, then exp x (r(v)v) is called a cut point of x, and the cut locus Cut(x) of x is defined as the set of all cut points of x. ...
doi:10.1007/s00526-009-0227-4
fatcat:egomxdmggfhpzaut6w4nn5qae4
Page 3362 of Mathematical Reviews Vol. , Issue 98E
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Also, his analysis shows that a new approximate analytic center can be obtained in O(1) Newton iterations, just like the cutting plane method which uses a single cut at each step. ...
The author considers the analytic center cutting plane (or column generation) algorithm for solving general convex problems defined by a separation oracle. ...
On the inequalities of Babuška-Aziz, Friedrichs and Horgan-Payne
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
For the Horgan-Payne inequality, which is an upper bound of the Friedrichs constant for plane star-shaped domains in terms of a geometric quantity known as the Horgan-Payne angle, we show that it is true ...
The equivalence between the inequalities of Babuška-Aziz and Friedrichs for sufficiently smooth bounded domains in the plane has been shown by Horgan and Payne 30 years ago. ...
We want to thank our colleagues Michel Crouzeix, Christine Bernardi, Vivette Girault and Fédéric Hecht for stimulating discussions. ...
arXiv:1303.6141v1
fatcat:enns2kva7ngf5oejcuaqhywe2a
Page 6962 of Mathematical Reviews Vol. , Issue 2002I
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “In this paper, an analytic center based cutting plane method is proposed for solving linear semi-infinite programming problems. ...
Jongen (D-AACH-M2; Aachen)
2002i:90096 90C34 90C53 Wu, Soon-Yi (RC-TAIN-AM; Tainan); Fang, Shu-Cherng (1-NCS-OI; Raleigh, NC); Lin, Chih-Jen (RC-NTAI-IFE; Taipei) Analytic center based cutting plane method ...
Page 4499 of Mathematical Reviews Vol. , Issue 2000f
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The authors consider an analytic center cutting plane method for a variational inequality problem of the following form: Find y* € Y and f* € F(y*) such that (f*)'(y — y*) >0 Vy € Y, where ¥ ={y€R”| A'y ...
-L. (3-MTRLC-G; Montreal, QC)
On a primal-dual analytic center cutting plane method for variational inequalities. (English summary)
Computational optimization—a tribute to Olvi Mangasarian, Part I. ...
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method
2002
Optimization Methods and Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present a survey of nondi erentiable optimization problems and methods with special focus on the analytic center cutting plane method. ...
Furthermore, interior point methods o er highly e cient and robust methods to compute these centers. The analytic center cutting plane method (ACCPM) has been built on that principle. ...
The analytic center cutting plane. From now on, the paper is devoted to an in-depth analysis of the analytic center cutting plane method. The convergence of the method was rst studied in 3]. ...
doi:10.1080/1055678021000060829a
fatcat:mkuaxh7n5vguvcj6orrron44fm
A tutorial on linear and bilinear matrix inequalities
2000
Journal of Process Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
This is a tutorial on the mathematical theory and process control applications of linear matrix inequalities (LMIs) and bilinear matrix inequalities (BMIs). ...
Many convex inequalities common in process control applications are shown to be LMIs. Proofs are included to familiarize the reader with the mathematics of LMIs and BMIs. ...
[22] gives analytical expressions for this cutting plane for each of the LMI problems. ...
doi:10.1016/s0959-1524(99)00056-6
fatcat:rbzl4vywrbfelpsai5xnghdaxi
« Previous
Showing results 1 — 15 out of 5,945 results