Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
feasibility problem
Description:
A mathematical problem of finding a point that satisfies a specified collection of sets or constraints, often studied in convex optimization.
Related topics:
Optimization and Variational Analysis (16%),
Advanced Optimization Algorithms Research (15%),
Complexity and Algorithms in Graphs (10%),
Stability and Control of Uncertain Systems (10%)
OpenAlex ID:
keywords/feasibility-problem
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
2011
·
Hedy Attouch
, Jérôme Bolte
, et al.
·
Mathematical Programming
·
1,820
Convex position estimation in wireless sensor networks
2002
·
L. Doherty
, K.S.J. pister
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
1,724
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
2016
·
Brendan O’Donoghue
, Eric Chu
, et al.
·
Journal of Optimization Theory and Applications
·
1,005
PDF
Finite-time control of linear systems subject to parametric uncertainties and disturbances
2001
·
Francesco Amato
, Marco Ariola
, et al.
·
Automatica
·
975
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
1990
·
Sanjoy K. Baruah
, Louis E. Rosier
, et al.
·
Real-Time Systems
·
651
Finite-time control of discrete-time linear systems
2005
·
F. Amato
, M. Ariola
·
IEEE Transactions on Automatic Control
·
471
Split Monotone Variational Inclusions
2011
·
A. Moudafi
·
Journal of Optimization Theory and Applications
·
455
From error bounds to the complexity of first-order descent methods for convex functions
2016
·
Jérôme Bolte
, Trong Phong Nguyen
, et al.
·
Mathematical Programming
·
375
PDF
Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results
2005
·
Ian Davidson
, S. S. Ravi
·
Lecture notes in computer science
·
332
A branch and bound solution method for the crane scheduling problem
1990
·
Roy I. Peterkofsky
, Carlos F. Daganzo
·
Transportation Research Part B Methodological
·
289
Strong Convergence to Common Fixed Points of Infinite Nonexpansive Mappings and Applications
2001
·
Kazuya Shimoji
, Wataru Takahashi
·
Taiwanese Journal of Mathematics
·
270
PDF
Strong NP-hardness of AC power flows feasibility
2019
·
Daniel Bienstock
, Abhinav Verma
·
Operations Research Letters
·
262
PDF
A new faster iteration process applied to constrained minimization and feasibility problems
2014
·
Mujahid Abbas
, Talat Nazir
·
UpSpace Institutional Repository (University of Pretoria)
·
248
A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
2014
·
Hédy Attouch
, Juan Peypouquet
, et al.
·
SIAM Journal on Optimization
·
225
A new algorithm for minimizing convex functions over convex sets
1996
·
Pravin M. Vaidya
·
Mathematical Programming
·
224
Delay-dependent Stability Analysis of Linear Time Delay Systems
2006
·
Frédéric Gouaisbaut
, Dimitri Peaucelle
·
IFAC Proceedings Volumes
·
207
Decentralized H∞ controller design: a matrix inequality approach using a homotopy method
2001
·
Guisheng Zhai
, Masao Ikeda
, et al.
·
Automatica
·
205
A note on the split common fixed-point problem for quasi-nonexpansive operators
2011
·
A. Moudafi
·
Nonlinear Analysis
·
189
The densest hemisphere problem
1978
·
D.S. Johnson
, F.P. Preparata
·
Theoretical Computer Science
·
184
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
1994
·
Dorit S. Hochbaum
, Joseph (Seffi) Naor
·
SIAM Journal on Computing
·
183
Untitled
1997
·
RAINER KOLISCH
, ANDREAS DREXL
·
IIE Transactions
·
164
Convergence theorems for nonexpansive mappings and feasibility problems
2000
·
W. Takahashi
, K. Shimoji
·
Mathematical and Computer Modelling
·
160
Parallel application of block-iterative methods in medical imaging and radiation therapy
1988
·
Yair Censor
·
Mathematical Programming
·
153
A polynomial newton method for linear programming
1986
·
Guy de Ghellinck
, Jean -Philippe Vial
·
Algorithmica
·
153
Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
1994
·
Michael D. Grigoriadis
, Leonid G. Khachiyan
·
SIAM Journal on Optimization
·
150
Show more works
View as search
Works count:
713
Citation count:
20,420
Year
Topic
Type