A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
A first-order primal-dual method with adaptivity to local smoothness
[article]
2021
arXiv
pre-print
Preserved Fulltext
Furthermore, when f is also locally strongly convex and A has full row rank we show that our method converges with a linear rate. ...
We propose an adaptive version of the Condat-Vũ algorithm, which alternates between primal gradient steps and dual proximal steps. ...
Acknowledgements The first author is grateful to Ya-Ping Hsieh for his feedback on the manuscript and for helpful research discussions throughout the development of this work. ...
arXiv:2110.15148v1
fatcat:knhloajgwzgxxneyu65bcyt7uy
Getting Feasible Variable Estimates from Infeasible Ones: MRF Local Polytope Study
2013
2013 IEEE International Conference on Computer Vision Workshops
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.
Whereas the infeasible primal estimates can typically be produced from (sub-)gradients of the dual function, it is often not easy to project them to the primal feasible set, since the projection itself ...
We apply our method to the local polytope relaxation of inference problems for Markov Random Fields and discuss its advantages over existing methods. ...
Prox-Point Primal-Dual Algorithms (First-Order Primal-Dual, ADMM, ADLP). ...
doi:10.1109/iccvw.2013.43
dblp:conf/iccvw/Savchynskyy013
fatcat:gi4momhiefdtncmjvk3xs23one
Error estimation and mesh adaptation for Signorini–Coulomb problems using E-FEM
2011
Computers & structures
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 2018; you can also visit the original URL.
The file type is application/pdf.
or remeshing in order to analyse the local errors with a view to determining appropriated mesh sizes for obtaining an overall target error. ...
Improving the solution by performing adaptive remeshing As mentioned above the aim of remeshing is to perform an initial calculation on an initial mesh in order to determine a topology of local errors, ...
doi:10.1016/j.compstruc.2010.11.001
fatcat:b5xgkjcmgjcdvkjlg5g7mqryi4
Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study
[article]
2012
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.
This paper proposes a method for construction of approximate feasible primal solutions from dual ones for large-scale optimization problems possessing certain separability properties. ...
We apply our method to the local polytope relaxation of inference problems for Markov Random Fields and demonstrate its superiority over existing methods. ...
For the experiments we employ our own implementations of the First Order Primal Dual Algorithm (acronym FPD) as described by , the adaptive diminishing smoothing algorithm ADSAL proposed by , the dual ...
arXiv:1210.4081v1
fatcat:kuktgtt6wjgpjoya3zo2a4dcee
An Adaptive Penalty Method for Inequality Constrained Minimization Problems
2019
European Conference on Numerical Mathematics and Advanced 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 2022; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2022 pre-print arXiv:2201.02425v1 fatcat:n2sklown6fgmdgogkh2xlx6cvy
The primal-dual active set method is observed to be the limit of a sequence of penalty formulations. ...
to the active set method. ...
This work forms a link between these two families by proposing a penalty method that adaptively evolves to the primal-dual active set method. ...
doi:10.1007/978-3-030-55874-1_14
dblp:conf/enumath/BoonN19
fatcat:3jmdgf2qyzghpa7pfgal5qleqq
Condition Number and Clustering-Based Efficiency Improvement of Reduced-Order Solvers for Contact Problems Using Lagrange Multipliers
2022
Mathematics
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 2022; you can also visit the original URL.
The file type is application/pdf.
A clustering strategy on the parametric space is then proposed in order to deal with piece-wise low-rank approximations. ...
On each cluster, a local accurate hyper-reduced model is built thanks to the enrichment strategies. ...
A local RID is built for each local model. As previously, a DEIM on the primal RB and a contribution from a DEIM on a dual POD RB (with a threshold = 10 −6 ) is used to obtain the set of nodes L. ...
doi:10.3390/math10091495
fatcat:7raduzqzrbeo5nq7oltcayjxg4
3D Adaptive Central Schemes: part I Algorithms for Assembling the Dual Mesh
[article]
2015
arXiv
pre-print
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.
Here we start with an adaptively refined cartesian primal grid in 3D and present a construction technique for the staggered dual grid based on L^∞-Voronoi cells. ...
The local refinement constellation on the primal grid leads to a finite number of uniquely defined local patterns on a primal cell. Assembling adjacent local patterns forms the dual grid. ...
Though up to now only first order, the extension of the staggered grid approach to a higher order 3D finite volume scheme is in process. ...
arXiv:1501.03614v1
fatcat:vf4frmujkvgcdohkz6d54xl5zu
Stochastic Coordinate Descent Methods for Regularized Smooth and Nonsmooth Losses
[chapter]
2012
Lecture Notes in Computer Science
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 2013; you can also visit the original URL.
The file type is application/pdf.
In particular, we first present a principled and practical SCD algorithm for regularized smooth losses, in which the one-variable subproblem is solved using the proximal gradient method and the adaptive ...
When the loss is nonsmooth, we present a novel SCD algorithm, in which the one-variable subproblem is solved using the dual averaging method. ...
Acknowledgments The work was supported in part by the NSFC (Grant No. 60835002, 60975040 and 61175050) and the first author is also supported by the Open Project Program of the NLPR. ...
doi:10.1007/978-3-642-33460-3_40
fatcat:oj35t52xtvh6pj4do77d7h7ltq
A Deep Primal-Dual Network for Guided Depth Super-Resolution
[article]
2016
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
We combine a deep fully convolutional network with a non-local variational method in a deep primal-dual network. ...
By unrolling the optimization steps of a first-order primal-dual algorithm and formulating it as a network, we can train our joint method end-to-end. ...
In the PDN we unroll the optimization procedure of a non-local variational model, namely of the first-order primal-dual algorithm [3] . ...
arXiv:1607.08569v1
fatcat:hqxhkgtjl5cplmpn2sqpdvfo3m
Robust Poisson Surface Reconstruction
[chapter]
2015
Lecture Notes in Computer Science
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 2015; you can also visit the original URL.
The file type is application/pdf.
We propose a method to reconstruct surfaces from oriented point clouds with non-uniform sampling and noise by formulating the problem as a convex minimization that reconstructs the indicator function of ...
For an efficient representation, we approximate the implicit function by a hierarchy of locally supported basis elements adapted to the geometry of the surface. ...
We choose a first-order method because the size of the problem makes second-order methods unfeasible. ...
doi:10.1007/978-3-319-18461-6_42
fatcat:pzsopmei65fxtpscaxwulvyx4m
Unsupervised saliency estimation based on robust hypotheses
2016
2016 IEEE Winter Conference on Applications of Computer Vision (WACV)
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 2018; you can also visit the original URL.
The file type is application/pdf.
The primal-dual interior point method is applied to optimize the proposed QP in polynomial time. ...
First, we propose an adaptive center-based bias hypothesis to replace the most common image center-based center-bias. ...
optimization We formulate the visual saliency estimation as a QP problem with linear equality and inequality constraints, and the primal-dual method can be applied to optimize the problem globally. ...
doi:10.1109/wacv.2016.7477623
dblp:conf/wacv/XuXCDZ16
fatcat:hz7ofjyxl5e3lmfc6wauqtttly
Multiscale Kernel Smoothing Using A Lifting Scheme
2009
Zenodo
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.
In order to enhance the number of dual vanishing moments (thereby creating more sparsity and better compressibility), one could replace the kernel smoothing by a more advanced local polynomial smoothing ...
In order to evaluate our method, we compare it with related lifting schemes on for irregular point sets. ...
doi:10.5281/zenodo.41389
fatcat:qllhwok5unchjchazvq3axkkxm
Multiscale Local Polynomial Smoothing in a Lifted Pyramid for Non-Equispaced Data
2013
IEEE Transactions on Signal Processing
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 2012; you can also visit the original URL.
The file type is application/pdf.
The design of these decomposition requires pairs of non-stationary filters, adapted to each other and to the locations of the observations at hand. ...
Thanks to the slight redundancy and to the smoothing operations in the lifting scheme, the proposed construction unifies sparsity of the analysis, smoothness of the reconstruction and stability of the ...
on one hand and linear interpolating prediction on the other hand, both methods equipped with a two-taps update for local primal vanishing moments. ...
doi:10.1109/tsp.2012.2225059
fatcat:e6b5l27hyjeuplaz3htpu2ojny
A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling
2011
CVPR 2011
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 2013; you can also visit the original URL.
The file type is application/pdf.
We show that in order to obtain an efficiently convergent iteration, this approach should be augmented with a dynamic estimation of a corresponding Lipschitz constant, leading to a runtime complexity of ...
In this paper, we focus specifically on Nesterov's optimal first-order optimization scheme for nonsmooth convex programs, that has been studied for a range of other problems in computer vision and machine ...
Smoothing selection Next we compare Nesterov's method with fixed smoothing to a method with adaptive smoothing for the same precision. In the first case, precision is selected according to (17) . ...
doi:10.1109/cvpr.2011.5995652
dblp:conf/cvpr/SavchynskyyKSS11
fatcat:z3fgazxkbzevpbvqbxooheqqie
Smooth and Strong: MAP Inference with Linear Convergence
2015
Neural Information Processing Systems
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.
However, optimization of the resulting program is in general challenging due to non-smoothness and complex non-separable constraints. ...
Specifically, we introduce strong convexity by adding a quadratic term to the LP relaxation objective. ...
To remedy this shortcoming, it has been proposed to smooth the objective by replacing the local maximization with a soft-max [7, 8] . ...
dblp:conf/nips/MeshiMS15
fatcat:n4abrdbmlrez7lyyxpqajtng3y
« Previous
Showing results 1 — 15 out of 9,993 results