Wang, Yuanheng; Huang, Bin; Jiang, Bingnan A self-adaptive relaxed primal-dual iterative algorithm for solving the split feasibility and the fixed point problem. (English) Zbl 07801779 Commun. Nonlinear Sci. Numer. Simul. 129, Article ID 107699, 16 p. (2024). MSC: 47H09 47H10 65K10 47H04 PDFBibTeX XMLCite \textit{Y. Wang} et al., Commun. Nonlinear Sci. Numer. Simul. 129, Article ID 107699, 16 p. (2024; Zbl 07801779) Full Text: DOI
Konnov, Igor Primal-dual method for optimization problems with changing constraints. (English) Zbl 1508.90060 Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 21st international conference, MOTOR 2022, Petrozavodsk, Russia, July 2–6, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13367, 46-61 (2022). MSC: 90C25 PDFBibTeX XMLCite \textit{I. Konnov}, Lect. Notes Comput. Sci. 13367, 46--61 (2022; Zbl 1508.90060) Full Text: DOI arXiv
Zhao, Jing; Hou, Dingfang; Wang, Xinglong A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings. (English) Zbl 07339866 Optimization 70, No. 4, 805-826 (2021). MSC: 47H09 47H10 47J05 54H25 PDFBibTeX XMLCite \textit{J. Zhao} et al., Optimization 70, No. 4, 805--826 (2021; Zbl 07339866) Full Text: DOI
Subramanian, Shreyas Vathul; DeLaurentis, Daniel A.; Sun, Dengfeng Dual averaging with adaptive random projection for solving evolving distributed optimization problems. (English) Zbl 1346.90674 J. Optim. Theory Appl. 170, No. 2, 493-511 (2016). MSC: 90C25 90C30 90C46 PDFBibTeX XMLCite \textit{S. V. Subramanian} et al., J. Optim. Theory Appl. 170, No. 2, 493--511 (2016; Zbl 1346.90674) Full Text: DOI
Necoara, Ion; Ferranti, Laura; Keviczky, Tamás An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization. (English) Zbl 1330.93098 Optim. Control Appl. Methods 36, No. 5, 648-666 (2015). MSC: 93B40 65K05 90C20 93C95 PDFBibTeX XMLCite \textit{I. Necoara} et al., Optim. Control Appl. Methods 36, No. 5, 648--666 (2015; Zbl 1330.93098) Full Text: DOI
Moerkotte, Guido; Montag, Martin; Repetti, Audrey; Steidl, Gabriele Proximal operator of quotient functions with application to a feasibility problem in query optimization. (English) Zbl 1327.49039 J. Comput. Appl. Math. 285, 243-255 (2015). MSC: 49K21 49M37 90C32 90C90 PDFBibTeX XMLCite \textit{G. Moerkotte} et al., J. Comput. Appl. Math. 285, 243--255 (2015; Zbl 1327.49039) Full Text: DOI
Li, Chong; Ng, K. F. The dual normal CHIP and linear regularity for infinite systems of convex sets in Banach spaces. (English) Zbl 1330.90076 SIAM J. Optim. 24, No. 3, 1075-1101 (2014). Reviewer: Constantin Zălinescu (Iaşi) MSC: 90C25 90C48 41A65 41A29 PDFBibTeX XMLCite \textit{C. Li} and \textit{K. F. Ng}, SIAM J. Optim. 24, No. 3, 1075--1101 (2014; Zbl 1330.90076) Full Text: DOI
Duan, Fujian; Fan, Lin; Fang, Minglei Feasibility conditions on a class of mathematical programs with nonlinear complementarity equilibrium constraints. (Chinese. English summary) Zbl 1212.90341 J. Nat. Sci. Heilongjiang Univ. 26, No. 5, 602-606 (2009). MSC: 90C30 90C33 49M37 PDFBibTeX XMLCite \textit{F. Duan} et al., J. Nat. Sci. Heilongjiang Univ. 26, No. 5, 602--606 (2009; Zbl 1212.90341)
Bauschke, H. H.; Kruk, S. G. Reflection-projection method for convex feasibility problems with an obtuse cone. (English) Zbl 1136.90432 J. Optim. Theory Appl. 120, No. 3, 503-531 (2004). MSC: 90C25 90C46 PDFBibTeX XMLCite \textit{H. H. Bauschke} and \textit{S. G. Kruk}, J. Optim. Theory Appl. 120, No. 3, 503--531 (2004; Zbl 1136.90432) Full Text: DOI
Dax, Achiya An open question on cyclic relaxation. (English) Zbl 1046.65044 BIT 43, Suppl., 929-943 (2003). MSC: 65K05 65F10 90C05 92C55 PDFBibTeX XMLCite \textit{A. Dax}, BIT 43, 929--943 (2003; Zbl 1046.65044) Full Text: DOI
Tits, André L.; Wächter, Andreas; Bakhtiari, Sasan; Urban, Thomas J.; Lawrence, Craig T. A primal-dual interior-point method for nonlinear programming with strong global and local convergence properties. (English) Zbl 1075.90078 SIAM J. Optim. 14, No. 1, 173-199 (2003). MSC: 90C51 65K05 90C30 PDFBibTeX XMLCite \textit{A. L. Tits} et al., SIAM J. Optim. 14, No. 1, 173--199 (2003; Zbl 1075.90078) Full Text: DOI
Bakhtiari, Sasan; Tits, André L. A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent. (English) Zbl 1038.90098 Comput. Optim. Appl. 25, No. 1-3, 17-38 (2003). MSC: 90C51 90C30 PDFBibTeX XMLCite \textit{S. Bakhtiari} and \textit{A. L. Tits}, Comput. Optim. Appl. 25, No. 1--3, 17--38 (2003; Zbl 1038.90098) Full Text: DOI
Caravani, Paolo Feedback Nash equilibrium of linearly constrained linear games. (English) Zbl 1042.91008 Petrosjan, L. A. (ed.) et al., 10th international symposium on dynamic games and applications. St. Petersburg, Russia. In 2 vol. St. Petersburg: International Society of Dynamic Games, St. Petersburg State Univ. (ISBN 5-7997-0412-6). 176-178 (2002). Reviewer: Ki Hang Kim (Montgomery) MSC: 91A25 PDFBibTeX XMLCite \textit{P. Caravani}, in: 10-ый международный симпозиум по динамическим играм и приложениям. St. Petersburg: International Society of Dynamic Games, St. Petersburg State Univ.. 176--178 (2002; Zbl 1042.91008)
Ubhaya, V. A. Isotone functions, dual cones, and networks. (English) Zbl 0973.90091 Appl. Math. Lett. 14, No. 4, 463-467 (2001). MSC: 90C46 90B10 41A30 PDFBibTeX XMLCite \textit{V. A. Ubhaya}, Appl. Math. Lett. 14, No. 4, 463--467 (2001; Zbl 0973.90091) Full Text: DOI
Sun, Xiaoling; Li, Duan Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation. (English) Zbl 0977.90028 Math. Oper. Res. 25, No. 4, 625-644 (2000). MSC: 90C10 90C46 PDFBibTeX XMLCite \textit{X. Sun} and \textit{D. Li}, Math. Oper. Res. 25, No. 4, 625--644 (2000; Zbl 0977.90028) Full Text: DOI
Pan, Pingqi A new perturbation simplex algorithm for linear programming. (English) Zbl 0940.65067 J. Comput. Math. 17, No. 3, 233-242 (1999). Reviewer: J.Parida (Rourkela) MSC: 65K05 90C05 PDFBibTeX XMLCite \textit{P. Pan}, J. Comput. Math. 17, No. 3, 233--242 (1999; Zbl 0940.65067)
Goffin, J. L.; Sharifi-Mokhtarian, F. Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method. (English) Zbl 0948.90149 J. Optimization Theory Appl. 101, No. 1, 35-58 (1999). MSC: 90C53 90C57 PDFBibTeX XMLCite \textit{J. L. Goffin} and \textit{F. Sharifi-Mokhtarian}, J. Optim. Theory Appl. 101, No. 1, 35--58 (1999; Zbl 0948.90149) Full Text: DOI
Potra, Florian A.; Sheng, Rongqin On homogeneous interior-point algorithms for semidefinite programming. (English) Zbl 0904.90118 Optim. Methods Softw. 9, No. 1-3, 161-184 (1998). MSC: 90C05 65K05 PDFBibTeX XMLCite \textit{F. A. Potra} and \textit{R. Sheng}, Optim. Methods Softw. 9, No. 1--3, 161--184 (1998; Zbl 0904.90118) Full Text: DOI
Pan, Pingqi The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study. (English) Zbl 0921.90119 Eur. J. Oper. Res. 101, No. 1, 164-176 (1997). MSC: 90C05 PDFBibTeX XMLCite \textit{P. Pan}, Eur. J. Oper. Res. 101, No. 1, 164--176 (1997; Zbl 0921.90119) Full Text: DOI
Goffin, Jean-Louis; Luo, Zhi-Quan; Ye, Yinyu Complexity analysis of an interior cutting plane method for convex feasibility problems. (English) Zbl 0856.90088 SIAM J. Optim. 6, No. 3, 638-652 (1996). MSC: 90C25 90C60 90C26 PDFBibTeX XMLCite \textit{J.-L. Goffin} et al., SIAM J. Optim. 6, No. 3, 638--652 (1996; Zbl 0856.90088) Full Text: DOI
Pan, Pingqi New non-monotone procedures for achieving dual feasibility. (English) Zbl 0844.90055 J. Nanjing Univ., Math. Biq. 12, No. 2, 155-162 (1995). MSC: 90C05 PDFBibTeX XMLCite \textit{P. Pan}, J. Nanjing Univ., Math. Biq. 12, No. 2, 155--162 (1995; Zbl 0844.90055)
Xu, Xiaojie; Ye, Yinyu A generalized homogeneous and self-dual algorithm for linear programming. (English) Zbl 0836.90119 Oper. Res. Lett. 17, No. 4, 181-190 (1995). MSC: 90C05 PDFBibTeX XMLCite \textit{X. Xu} and \textit{Y. Ye}, Oper. Res. Lett. 17, No. 4, 181--190 (1995; Zbl 0836.90119) Full Text: DOI
Pan, Pingqi A variant of the dual pivoting rule in linear programming. (English) Zbl 0816.90102 J. Inf. Optim. Sci. 15, No. 3, 405-413 (1994). MSC: 90C05 PDFBibTeX XMLCite \textit{P. Pan}, J. Inf. Optim. Sci. 15, No. 3, 405--413 (1994; Zbl 0816.90102) Full Text: DOI
Lent, Arnold; Censor, Yair The primal-dual algorithm as a constraint-set-manipulation device. (English) Zbl 0734.90066 Math. Program., Ser. A 50, No. 3, 343-357 (1991). MSC: 90C25 90-08 PDFBibTeX XMLCite \textit{A. Lent} and \textit{Y. Censor}, Math. Program. 50, No. 3 (A), 343--357 (1991; Zbl 0734.90066) Full Text: DOI
Comeau, M. A.; Thulasiraman, K. Structure of the submarking-reachability problem and network programming. (English) Zbl 0648.90081 IEEE Trans. Circuits Syst. 35, No. 1, 89-100 (1988). Reviewer: C.Radu MSC: 90C35 90B10 PDFBibTeX XMLCite \textit{M. A. Comeau} and \textit{K. Thulasiraman}, IEEE Trans. Circuits Syst. 35, No. 1, 89--100 (1988; Zbl 0648.90081) Full Text: DOI
Barcia, Paulo Constructive dual methods for discrete programming. (English) Zbl 0642.90078 Discrete Appl. Math. 18, 107-117 (1987). MSC: 90C10 90C09 65K05 PDFBibTeX XMLCite \textit{P. Barcia}, Discrete Appl. Math. 18, 107--117 (1987; Zbl 0642.90078) Full Text: DOI
Wallace, Stein W. Decomposing the requirement space of a transportation problem into polyhedral cones. (English) Zbl 0599.90078 Math. Program. Study 28, 29-47 (1986). Reviewer: E.Tamm MSC: 90C08 90C05 PDFBibTeX XMLCite \textit{S. W. Wallace}, Math. Program. Study 28, 29--47 (1986; Zbl 0599.90078) Full Text: DOI
Markowski, Carol A.; Ignizio, James P. Theory and properties of the lexicographic linear goal programming dual. (English) Zbl 0549.90083 Large Scale Syst. 5, 115-121 (1983). Reviewer: I.Kaneko MSC: 90C31 90C05 49N15 90C06 PDFBibTeX XMLCite \textit{C. A. Markowski} and \textit{J. P. Ignizio}, Large Scale Syst. 5, 115--121 (1983; Zbl 0549.90083)
Tind, Jorgen; Wolsey, Laurence A. An elementary survey of general duality theory in mathematical programming. (English) Zbl 0467.90061 Math. Program. 21, 241-261 (1981). MSC: 90C30 90-02 49N15 90C10 91B99 65K05 PDFBibTeX XMLCite \textit{J. Tind} and \textit{L. A. Wolsey}, Math. Program. 21, 241--261 (1981; Zbl 0467.90061) Full Text: DOI